Projected Chvátal–Gomory cuts for mixed integer linear programs

Recent experiments by Fischetti and Lodi show that the first Chvátal closure of a pure integer linear program (ILP) often gives a surprisingly tight approximation of the integer hull. They optimize over the first Chvátal closure by modeling the Chvátal–Gomory (CG) separation problem as a mixed integer linear program (MILP) which is then solved by a general- purpose MILP solver. Unfortunately, this approach does not extend immediately to the Gomory mixed integer (GMI) closure of an MILP, since the GMI separation problem involves the solution of a nonlinear mixed integer program or a parametric MILP. In this paper we introduce a projected version of the CG cuts, and study their practical effectiveness for MILP problems. The idea is to project first the linear programming relaxation of the MILP at hand onto the space of the integer variables, and then to derive Chvátal–Gomory cuts for the projected polyhedron. Though theoretically dominated by GMI cuts, projected CG cuts have the advantage of producing a separation model very similar to the one introduced by Fischetti and Lodi, which can typically be solved in a reasonable amount of computing time.

[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]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

[3]  Egon Balas,et al.  Optimizing over the split closure , 2008, Math. Program..

[4]  Matteo Fischetti,et al.  A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000, Networks.

[5]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[6]  Alexander Schrijver,et al.  On Cutting Planes , 1980 .

[7]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[8]  Matteo Fischetti,et al.  Combinatorial Benders' Cuts for Mixed-Integer Linear Programming , 2006, Oper. Res..

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

[10]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[11]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[12]  Matteo Fischetti,et al.  Optimizing over the first Chvátal closure , 2005, Math. Program..

[13]  M. Grötschel,et al.  A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000 .

[14]  Gérard Cornuéjols,et al.  A connection between cutting plane theory and the geometry of numbers , 2002, Math. Program..

[15]  Alberto Caprara,et al.  On the separation of split cuts and related inequalities , 2003, Math. Program..

[16]  Matteo Fischetti,et al.  Combinatorial Benders' Cuts , 2004, IPCO.

[17]  Gérard Cornuéjols,et al.  On the Rank of Mixed 0, 1 Polyhedra , 2001, IPCO.

[18]  Ralph E. Gomory,et al.  Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.

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

[20]  Andrea Lodi,et al.  On the MIR Closure of Polyhedra , 2007, IPCO.

[21]  Friedrich Eisenbrand,et al.  NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron , 1999, Comb..

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

[23]  Norbert Ascheuer,et al.  Hamiltonian path problems in the on-line optimization of flexible manufacturing systems , 1996 .

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

[25]  Petra Mutzel,et al.  Optimal labeling of point features in rectangular labeling models , 2003, Math. Program..