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

Mathematical Programming

Volumn 113, Issue 2, 2008, Pages 241-257

  Bonami, Pierre ^a   Cornuéjols, Gérard ^b,c   Dash, Sanjeeb ^a   Fischetti, Matteo ^d   Lodi, Andrea ^e  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c AIX MARSEILLE UNIV   (France)

^d UNIVERSITY OF PADOVA   (Italy)

^e UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Chv tal Gomory cut; Mixed integer linear program; Projected polyhedron; Separation problem

Indexed keywords

APPROXIMATION THEORY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; RELAXATION PROCESSES;

MIXED INTEGER LINEAR PROGRAMS; PROJECTED POLYHEDRON; SEPARATION PROBLEM;

LINEAR PROGRAMMING;

EID: 38749131984     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0051-y     Document Type: Article

References (25)

1. Ascheuer, N.: Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. PhD Thesis, Technische Universität Berlin, Berlin (1995)
2. Ascheuer, N., Fischetti, M., Grötschel, M.: A polyhedral study of the asymmetric travelling salesman problem with time windows. Networks 36, 69-79 (2000)
3. Balas, E., Ceria, S., Cornuéjols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58, 295-324 (1993)
4. Balas, E., Saxena, A.: Optimizing over the Split Closure: Modeling and Theoretical Analysis, IMA "Hot Topics" Workshop: Mixed Integer Programming, Minneapolis, 25-29 July 2005
5. Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: MIPLIB 3.0, http://www.caam. rice.edu/~bixby/miplib/miplib.html
6. Bonami, P., Minoux,M.: Using rank-1 lift-and-project closures to generate cuts for 0-1MIPs, a computational investigation. Discrete Optim. 2, 288-307 (2005)
7. Caprara, A., Letchford, A.N.: On the separation of split cuts and related inequalities. Math. Program. 94, 279-294 (2003)
8. Chvátal, V.: Edmonds polytopes and a hierarchy of combinatorial problems C73. Discrete Math. 4, 305-337 (1973)
9. Codato, G., Fischetti, M.: Combinatorial Benders' cuts for mixed-integer linear programming. Oper. Res. 54, 756-766 (2006)
10. COIN-OR. www.coin-or.org
11. Cook, W., Kannan, R., Schrijver, A.: Chvátal closures for mixed integer programming problems. Math. Program. 47, 155-174 (1990)
12. Cornuéjols, G., Li, Y.: On the rank of mixed 0,1 polyhedra.Math. Program. 91, 391-397 (2002)
13. Cornuéjols, G., Li, Y.: A connection between cutting plane theory and the geometry of numbers. Math. Program. 93, 123-127 (2002)
14. Dash, S., Günlük, O., Lodi, A.: On the MIR closure of polyhedra. IBM, T.J. Watson Research, Working paper (2005)
15. Eisenbrand, F.:On the membership problem for the elementary closure of a polyhedron. Combinatorica 19, 297-300 (1999)
16. Fischetti, M., Lodi, A. : Optimizing over the first Ch closure. In: Jünger, M., Kaibel, V. (eds.) Integer Programming and Combinatorial Optimization-IPCO 2005, LNCS 3509., pp. 12-22. Springer, Berlin Heidelberg New York (2005)
17. Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull AMS 64, 275-278 (1958)
18. Gomory, R.E.: An algorithm for integer solutions to linear programs. In: Graves, R.L., Wolfe, P. (eds.) Recent Advances in Mathematical Programming., pp. 269-302. McGraw-Hill, New York (1963)
19. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin Heidelberg New York (1988)
20. ILOG Cplex 9.0: User's Manual and Reference Manual, ILOG, S.A., http://www.ilog.com/ (2005)
21. Klau,G.W., Mützel,P.: Optimal labelling of point features in rectangular labellingmodels.Math. Program. 94, 435-458 (2003)
22. Marchand, H., Wolsey, L.A.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49, 363-371 (2001)
23. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
24. Nemhauser,G.L.,Wolsey, L.A.:Arecursive procedure to generate all cuts for 0-1 mixed integer programs. Math. Program. 46, 379-390 (1990)
25. Schrijver, A.: On cutting planes. Ann. Discrete Math. 9, 291-296 (1980)