An implicit enumeration program for zero-one integer programming

This paper describes some techniques to improve the speed of the implicit enumeration method for solving zero-one integer programming problems. Among these techniques, the most powerful is the one of using a column vector which works as a tag for each inequality, indicating whether or not the inequality should be checked for the current partial solution. A new condition for underlining a variable and the concept of pseudo-underlining are also proposed. These techniques were implemented in the computer programil lip (ILLinois Integer Programming code). The computational results for different types of problems are discussed.

[1]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[2]  Sergiu Rudeanu,et al.  Pseudo-Boolean Methods for Bivalent Programming , 1966 .

[3]  Raoul J. Freeman.  Letter to the Editor - Computational Experience with a "Balasian" Integer Programming Algorithm , 1966, Oper. Res..

[4]  R. Fridshal,et al.  An application of linear programming to the minimization of Boolean functions , 1961, SWCT.

[5]  Bernhard Fleischmann.  Letter to the Editor - Computational Experience with the Algorithm of Balas , 1967, Oper. Res..

[6]  Samsão Woiler,et al.  Implicit enumeration algorithms for discrete optimization problems , 1968 .

[7]  F. Glover.  A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[8]  Edward J. McCluskey,et al.  Introduction to the theory of switching circuits , 1965 .

[9]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[10]  Clifford C. Petersen,et al.  Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects , 1967 .

[11]  A. M. Geoffrion.  Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .

[12]  Leo Hellerman,et al.  A Catalog of Three-Variable Or-Invert and And-Invert Logical Circuits , 1963, IEEE Trans. Electron. Comput..

[13]  Egon Balas,et al.  Discrete Programming by the Filter Method , 1967, Oper. Res..

[14]  Kurt Spielberg,et al.  Direct Search Algorithms for Zero-One and Mixed-Integer Programming , 1967, Oper. Res..

[15]  Arthur M. Geoffrion,et al.  An Improved Implicit Enumeration Approach for Integer Programming , 1969, Oper. Res..

[16]  F. Glover.  AN ALL-INTEGER INTEGER PROGRAMMING ALGORITHM , 1963 .

[17]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[18]  George L. Nemhauser,et al.  The Traveling Salesman Problem: A Survey , 1968, Oper. Res..

[19]  G. Nemhauser,et al.  Integer Programming , 2020 .