In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide ...
Computer programs to solve linear programming problems by the simplex method have existed since the early 1950s. They remain the central feature of today's mathematical programming systems. There has ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback