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

Abdelouahab Zaghrouti, François Soumis, Issmail El Hallaoui, Integral Simplex Using Decomposition for the Set Partitioning Problem, Operations Research, Vol. 62, No. 2 (March-April 2014), pp. 435-449 ...