Generalized implicit enumeration using bounds on variables for solving linear programs with zero-one variables

In an earlier paper [1] we put forth a framework that helps to tie together a number of approaches for solving integer programming problems. We outlined there how Balas' Additive Algorithm can be explained and generalized in terms of the framework. In the present paper we review Balas' algorithm, and our earlier framework, and present an algorithm generalizing Balas' scheme. In addition, some examples are presented and future research to be done is discussed.