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 ...

A number of important new results are derived that were not originally envisaged: The method generates primal-feasible and dual-feasible points, the primal objective is monotonically decreased, and a ...