Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

Various techniques for building relaxations and generating valid inequalities for pure or mixed integer programming problems without special structure are reviewed and compared computationally. Besides classical techniques such as Gomory cuts, Mixed Integer Rounding cuts, lift-and-project and reformulation-linearization techniques, a new variant is also investigated: the use of the relaxation corresponding to the intersection of simple disjunction polyhedra (i.e. the so-called elementary closure of lift-and-project cuts). Systematic comparative computational results are reported on series of test problems including multidimensional knapsack problems (MKP) and MIPLIB test problems. From the results obtained, the relaxation based on the elementary closure of lift-and-project cuts appears to be one of the most promising.

[1]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[2]  J. P. Secrétan,et al.  Der Saccus endolymphaticus bei Entzündungsprozessen , 1944 .

[3]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[4]  Laurence A. Wolsey,et al.  A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..

[5]  E. Balas,et al.  Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

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

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

[8]  Michel X. Goemans,et al.  The Steiner tree polytope and related polyhedra , 1994, Math. Program..

[9]  Egon Balas,et al.  Gomory cuts revisited , 1996, Oper. Res. Lett..

[10]  Ralph E. Gomory,et al.  Solving linear programming problems in integers , 1960 .

[11]  M. R. Rao,et al.  Solving the Steiner Tree Problem on a Graph Using Branch and Cut , 1992, INFORMS J. Comput..

[12]  Michel Minoux,et al.  Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods , 2001, Ann. Oper. Res..

[13]  M. R. Rao,et al.  The Steiner tree problem I: Formulations, compositions and extension of facets , 1994, Math. Program..

[14]  Egon Balas,et al.  Lift-and-project for Mixed 0-1 programming: recent progress , 2002, Discret. Appl. Math..

[15]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[16]  P. Bonami.  Etude et mise en œuvre d'approches polyédriques pour la résolution de programmes en nombres entiers ou mixtes généraux , 2003 .

[17]  Martin W. P. Savelsbergh,et al.  An Updated Mixed Integer Programming Library: MIPLIB 3.0 , 1998 .

[18]  William J. Cook,et al.  TSP Cuts Which Do Not Conform to the Template Paradigm , 2000, Computational Combinatorial Optimization.

[19]  M. R. Rao,et al.  The Steiner tree problem II: Properties and classes of facets , 1994, Math. Program..

[20]  Mechthild Stoer,et al.  Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints , 1992, SIAM J. Optim..

[21]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[22]  Michel Minoux,et al.  Exact MAX-2SAT solution via lift-and-project closure , 2006, Oper. Res. Lett..

[23]  Egon Balas,et al.  programming: Properties of the convex hull of feasible points * , 1998 .

[24]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

[25]  Martin Grötschel,et al.  Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints , 1992, Oper. Res..

[26]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[27]  Egon Balas,et al.  A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming , 2003, Math. Program..

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

[30]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

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

[32]  M. Stoer,et al.  A polyhedral approach to multicommodity survivable network design , 1994 .

[33]  Kent Andersen,et al.  Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts , 2005, Manag. Sci..

[34]  Oktay Günlük,et al.  Computational experience with a difficult mixedinteger multicommodity flow problem , 1995, Math. Program..

[35]  Gérard Cornuéjols,et al.  Elementary closures for integer programs , 2001, Oper. Res. Lett..

[36]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[37]  Geir Dahl,et al.  A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems , 1998, INFORMS J. Comput..

[38]  M. Stoer.  Design of Survivable Networks , 1993 .

[39]  Robert G. Jeroslow,et al.  Cutting-Plane Theory: Disjunctive Methods , 1977 .