Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework

We investigate the computational issues that need to be addressed when incorporating general cutting planes for mixed 0-1 programs into a branch-and-cut framework. The cuts we use are of the lift-and-project variety. Some of the issues addressed have a theoretical answer, but others are of an experimental nature and are settled by comparing alternatives on a set of test problems. The resulting code is a robust solver for mixed 0-1 programs. We compare it with several existing codes. On a wide range of test problems it performs as well as, or better than, some of the best currently available mixed integer programming codes.

[1]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[2]  Egon Balas,et al.  Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..

[3]  E. Balas,et al.  Strengthening cuts for mixed integer programs , 1980 .

[4]  Silvio Ursic,et al.  A Linear Characterization of NP-Complete Problems , 1984, CADE.

[5]  Laurence A. Wolsey,et al.  Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..

[6]  Andrzej Pelc,et al.  Distributed probabilistic fault diagnosis for multiprocessor systems , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.

[7]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[8]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[9]  Manfred W. Padberg,et al.  Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut , 1991, INFORMS J. Comput..

[10]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[11]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[12]  Egon Balas,et al.  Solving mixed 0-1programs by a lift-and-project method , 1993, SODA '93.

[13]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[14]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..