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

Abstract : 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.
Complete list of metadatas
Contributor : Pierre Bonami <>
Submitted on : Saturday, October 3, 2009 - 11:58:42 AM
Last modification on : Thursday, June 14, 2018 - 10:54:02 AM

Links full text




Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi. Projected Chvátal–Gomory cuts for mixed integer linear programs. Mathematical Programming, Series A, Springer, 2008, 113 (2), pp.241-257. ⟨10.1007/s10107-006-0051-y⟩. ⟨hal-00421752⟩



Record views