INTEGER PROGRAMMING BY IMPLICIT ENUMERATION AND BALAS' METHOD
RAND CORP SANTA MONICA CA
Pagination or Media Count:
This memorandum presents a reformulation of the essentials of Balas algorithm for the zero-one integer linear programming problem, and is based upon the idea of elementary tree search that has also been used by Glover as the basis for his multiphase-dual algorithm. The present reformulation requires considerably less computer storage than the original version, and clarifies the rationale behind the algorithm, thereby leading naturally to variants and extensions.
- Operations Research