Reduce-and-split cuts: Improving the performance of mixed-integer Gomory cuts

Management Science

Volumn 51, Issue 11, 2005, Pages 1720-1732

  Andersen, Kent ^a   Cornuéjols, Gérard ^b,c   Li, Yanjun ^d  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c AIX MARSEILLE UNIV   (France)

^d PURDUE UNIVERSITY   (United States)

Author keywords

Cutting plane; Integer programming; Mixed integer Gomory cut; Mixed integer programming; Reduce and split cut; Split cut

Indexed keywords

CUTTING PLANES; MIXED-INTEGER GOMORY CUT; MIXED-INTEGER PROGRAMMING; REDUCE-AND-SPLIT CUTS;

ALGORITHMS; COMPUTER SOFTWARE; HEURISTIC METHODS; PROBLEM SOLVING;

INTEGER PROGRAMMING;

EID: 27744530142     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.1050.0382     Document Type: Article

References (21)

1. Andersen, K., G. Cornuéjols, Y. Li. 2005. Split closure and intersection cuts. Math. Programming A 102 457-493.
2. Balas, E. 1971. Intersection cuts - A new type of cutting planes for integer programming. Oper. Res. 19 19-39.
3. Balas, E. 1979. Disjunctive programming. Ann. Discrete Math. 5 3-51.
4. Balas, E., R. G. Jeroslow. 1980. Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4 224-234.
5. Balas, E., M. Perregaard. 2003. A Precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming. Math. Programming B 94 221-245.
6. Balas, E., S. Ceria, G. Cornuéjols. 1996a. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Sci. 42 1229-1246.
7. Balas, E., S. Ceria, G. Cornuéjols, N. R. Natraj. 1996b. Gomory cuts revisited. Oper. Res. Lett. 19 1-9.
8. Bixby, R. E., S. Ceria, C. M. McZeal, M. W. P. Savelsbergh. 1998. An updated mixed integer programming library: MIPLIB 3.0. Optima 58 12-15.
9. Bixby, R. E., Z. Gu, E. Rothberg, R. Wunderling. 2004. Mixed integer programming: A progress report. M. Grötschel, ed. The sharpest cut: The impact of Manfred Padberg and his work. MPS/SIAM Ser. Optim. 309-326.
10. Caprara, A., A. Letchford. 2003. On the separation of split cuts and related inequalities. Math. Programming 94 279-294.
11. Ceria, S., G. Cornuéjols, M. Dawande. 1995. Combining and strengthening Gomory cuts. E. Balas, J. Clausen, eds. Integer Programming and Combinatorial Optimization. LNCS, No. 920, 438-451.
12. Cook, W., R. Kannan, A. Schrijver. 1990. Chvátal closures for mixed integer programs. Math. Programming 47 155-174.
13. Cornuéjols, G., Y. Li. 2002. A connection between cutting plane theory and the geometry of numbers. Math. Programming 93 123-127.
14. Cornuéjols, G., Y Li, D. Vandenbussche. 2003. K-cuts: A variation of Gomory mixed integer cuts from the LP tableau. INFORMS J. Comput. 15 385-396.
15. CPLEX optimizer version 8.0, ILOG. 2002.
16. Crowder, H., E. Johnson, M. Padberg. 1983. Solving large-scale zero-one linear programming problems. Oper. Res. 31 803-834.
17. Eckstein, J. E., M. Nediak. February 2003. Depth-optimized convexity cuts. Technical report, RUTCOR, Rutgers University, Piscataway, NJ.
18. Gomory, R. E. 1960. An algorithm for the mixed integer problem. Technical report RM-2597, The RAND Corporation, Santa Monica, CA.
19. Gomory, R. E., E. L. Johnson. 2003. T-space and cutting planes. Math. Programming B 96 341-375.
20. Lenstra, A. K., H. W. Lenstra, L. Lovász. 1982. Factoring polynomials with rational coefficients. Math. Ann. 261 515-534.
21. Nemhauser, G. L., L. A. Wolsey. 1990. A recursive procedure for generating all cuts for 0-1 mixed integer programs. Math. Programming 46 379-390.