论文信息 - Split closure and intersection cuts

Split closure and intersection cuts

Abstract.In the seventies, Balas introduced intersection cuts for a Mixed Integer Linear Program (MILP), and showed that these cuts can be obtained by a closed form formula from a basis of the standard linear programming relaxation. In the early nineties, Cook, Kannan and Schrijver introduced the split closure of a MILP, and showed that the split closure is a polyhedron. In this paper, we show that the split closure can be obtained using only intersection cuts. We give two different proofs of this result, one geometric and one algebraic. The result is then used to provide a new proof of the fact that the split closure of a MILP is a polyhedron. Finally, we extend the result to more general disjunctions.

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

[2] Robert E. Bixby,et al. Mixed-Integer Programming: A Progress Report , 2004, The Sharpest Cut.

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

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

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

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

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

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

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