This is a preview. Log in through your library . Abstract In this paper, a modification of the bisection simplex method is made for more general purpose use. Organized in an alternative simpler form, ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback