Complexity Reduction for Solving a Pure Integer Program by the Branch and Bound Method Using Gomory Constraints

Abstract

This paper deals with improving complexity of the branch and bound method for solving a pure integer program. This improvement is achieved by formulating a characteristic pure integer program from all the Gomory constraints arising from the relaxed LP solution of the given problem. The number of sub-problems required in the branch and bound method reduce significantly