A new lift-and-project operator

In this paper, we analyze the strength of split cuts in a lift-and-project framework. We first observe that the Lovasz–Schrijver and Sherali–Adams lift-and-project operator hierarchies can be viewed as applying specific 0–1 split cuts to an appropriate extended formulation and demonstrate how to strengthen these hierarchies using additional split cuts. More precisely, we define a new operator that adds all 0–1 split cuts to the extended formulation. For 0–1 mixed-integer sets with k binary variables, this new operator is guaranteed to obtain the integer hull in ⌈k/2⌉ steps compared to k steps for the Lovasz–Schrijver or the Sherali–Adams operator. We also present computational results on the stable set problem with our new operator.

[1]  M. Minoux,et al.  Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation , 2005, Discret. Optim..

[2]  Sanjeeb Dash,et al.  Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse , 2017, INFORMS J. Comput..

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

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

[5]  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..

[6]  Nil. I. Fcbniary.  ON THE MATRIX-CUT RANK OF POLYHEDRA , 2005 .

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

[8]  Franz Rendl,et al.  Semidefinite programming relaxations for graph coloring and maximal clique problems , 2007, Math. Program..

[9]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[10]  Monique Guignard-Spielberg,et al.  A level-2 reformulation-linearization technique bound for the quadratic assignment problem , 2007, Eur. J. Oper. Res..

[11]  James Ostrowski.  Using symmetry to optimize over the Sherali–Adams relaxation , 2014, Math. Program. Comput..

[12]  Fabrizio Rossi,et al.  Strong lift-and-project cutting planes for the stable set problem , 2013, Math. Program..

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

[14]  Sanjeeb Dash,et al.  Cutting planes from extended LP formulations , 2017, Math. Program..

[15]  Adam N. Letchford,et al.  An application of the Lovász–Schrijver M(K, K) operator to the stable set problem , 2009, Math. Program..

[16]  Monique Laurent,et al.  A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..

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

[18]  Jean B. Lasserre,et al.  An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs , 2001, IPCO.

[19]  Samuel Burer,et al.  Solving Lift-and-Project Relaxations of Binary Integer Programs , 2006, SIAM J. Optim..

[20]  Egon Balas,et al.  Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization , 2005, Ann. Oper. Res..

[21]  William J. Cook,et al.  Chvátal closures for mixed integer programming problems , 1990, Math. Program..

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

[23]  E. Balas.  Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .

[24]  Franz Rendl,et al.  Computational Experience with Stable Set Relaxations , 2002, SIAM J. Optim..

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