COMPUTATIONAL EXPERIENCE WITH THE BALAS INTEGER PROGRAMMING ALGORITHM

A recent and significant addition to the literature of partial enumeration methods of solving integer linear programming problems has been the algorithm of Balas (E. Balas. An additive algorithm for solving linear programs with zero-one variables. Operations Research, v.13:517-546 (July-Aug 1965). building upon the foundation laid by Balas and (F. Glover. A multiphase-dual algorithm for the zero-one integer programming problem. Management Sciences Research Rept. no. 25, Dec 64, Graduate School of Industrial Administration, Carnegie Institute of Technology), a version of this algorithm was outlined in (A. Geoffrion. A reformulation of Balas' algorithm for integer linear programming. Rand Corp., RM-4783-PR, Sep 1965) that especially lends itself to computer implementation. This has since been programmed, and the purpose of this report is to describe some computational experience with the algorithm and to discuss future avenues of research that may be undertaken.