The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general ...

In this paper, a modification of the bisection simplex method is made for more general purpose use. Organized in an alternative simpler form, the modified version exploits information of the optimal ...