Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

Discrete Optimization

Volumn 2, Issue 4, 2005, Pages 288-307

  Bonami, P ^a   Minoux, M ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

Cutting planes; Lift and project; Mixed integer programming; Rank 1 closures

Indexed keywords

COMPUTATIONAL METHODS; LINEARIZATION; PROBLEM SOLVING; RELAXATION PROCESSES;

CUTTING-PLANES; LIFT-AND-PROJECT; MIXED INTEGER PROGRAMMING; RANK-1 CLOSURES;

INTEGER PROGRAMMING;

EID: 27744566331     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2005.08.006     Document Type: Article

References (39)

1. D. Applegate, R. Bixby, V. Chvátal, W. Cook, TSP cuts which do not conform to the template paradigm, in: Computational combinatorial optimization (Schloß Dagstuhl, 2000), Lecture Notes in Computer Science, vol. 2241, Springer, Berlin, 2001, pp. 261-303
2. E. Balas Disjunctive programming Ann. Discrete Math. 5 1979 3 51
3. E. Balas Disjunctive programming: properties of the convex hull of feasible points Discrete Appl. Math. 89 1998 3 44 (originaly MSRR # 348, Carnegie Mellon University, July 1974)
4. E. Balas, S. Ceria, and G. Cornuéjols A lift-and-project cutting plane algorithm for mixed 0-1 programs Math. Programming 58 1993 295 324
5. E. Balas, S. Ceria, and G. Cornuéjols Mixed 0-1 programming by lift-and-project in a branch-and-cut framework Management Sci. 42 1996 1229 1246
6. E. Balas, S. Ceria, G. Cornuéjols, and N. Natraj Gomory cuts revisited Oper. Res. Lett. 19 1996 1 9
7. E. Balas, and R.G. Jeroslow Strengthening cuts for mixed integer programs European J. Oper. Res. 4 4 1980 224 234
8. E. Balas, and M. Perregaard Lift and project for mixed 0-1 programming: recent progress Discrete Appl. Math. 123 1-3 2002 129 154
9. E. Balas, and M. Perregaard A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming Math. Programming 94 2-3, Ser. B 2003 221 245 The Aussois 2000 Workshop in Combinatorial Optimization
10. J.E. Beasley. OR-Library. < http://people.brunel.ac.uk/mastjjb/jeb/ info.html>.
11. J.F. Benders Partitioning procedures for solving mixed-variables programming problems Numer. Math. 4 1962 238 252
12. D. Bienstock, and O. Günlük Computational experience with a difficult mixed-integer multicommodity flow problem Math. Programming 68 2, Ser. A 1995 213 237
13. R.E. Bixby, S. Ceria, C.M. McZeal, M.W.P. Savelsbergh, Miplib3.0, < http://www.caam.rice.edu/ ∼ bixby/miplib/miplib3.html >.
14. R.E. Bixby, S. Ceria, C.M. McZeal, and M.W.P. Savelsbergh An updated mixed integer programming library: MIPLIB 3.0 Optima 58 1998 12 15
15. P. Bonami, Étude et mise en oeuvre d'approches polyédriques pour la résolution de programmes en nombres entiers ou mixtes géńéraux, Ph.D. Thesis, Université Paris 6, 2003.
16. S. Chopra, E.R. Gorres, and M.R. Rao Solving the Steiner tree problem on a graph using branch and cut ORSA J. Comput. 4 1992 320 335
17. S. Chopra, and M.R. Rao The Steiner tree problem. I. Formulations compositions and extension of facets Math. Programming 64 2, Ser. A 1994 209 229
18. P.C. Chu, and J.E. Beasley A genetic algorithm for the multidimensional knapsack problem J. Heuristics 4 1998 63 86
19. COIN, Computational infrastructure for operations research, .
20. G. Cornuéjols, and Y. Li Elementary closures for integer programs Oper. Res. Lett. 28 2001 1 8
21. H. Crowder, and M.W. Padberg Solving large-scale symmetric travelling salesman problems to optimality Management Sci. 26 5 1980 495 509
22. G. Dahl, and M. Stoer A cutting plane algorithm for multicommodity survivable network design problems INFORMS J. Comput. 10 1 1998 1 11
23. M.X. Goemans The Steiner tree polytope and related polyhedra Math. Programming 63 1994 157 182
24. R.E. Gomory Solving linear programming problems in integers R. Bellman M. Hall Combinatorial Analysis, Proceedings of Symposia in Applied Mathematics vol. 10 1960 Providence RI 211 216
25. R.E. Gomory An algorithm for integer solution to linear programming R.L. Graves P. Wolfe Recent Advances in Mathematical Programming 1963 McGraw-Hill New York 269 302
26. M. Grötschel, C.L. Monma, and M. Stoer Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints Oper. Res. 40 2 1992 309 330
27. M. Grötschel, C.L. Monma, and M. Stoer Facets for polyhedra arising in the design of communication networks with low-connectivity constraints SIAM J. Optim. 2 3 1992 474 504
28. M. Grötschel, C.L. Monma, and M. Stoer Design of survivable networks Network models, Handbooks of Operations Research Management Science vol. 7 1995 North-Holland Amsterdam 617 672
29. R.G. Jeroslow Cutting-plane theory: disjunctive methods Studies in Integer Programming (Proceedings of the Workshop, Bonn, 1975), Ann. Discrete Math. vol. 1 1977 North-Holland Amsterdam 293 330
30. L. Lovász, and A. Schrijver Cone of matrices and set functions, and 0,1 optimization SIAM J. Optim. 1 2 1991 166 190
31. H. Marchand, and L.A. Wolsey Aggregation and mixed integer rounding to solve MIPs Oper. Res. 49 3 2001 363 371
32. M. Minoux Discrete cost multicommodity network optimization problems and exact solution methods Ann. Oper. Res. 106 2002 19 46 (Topological network design in telecommunication systems)
33. G.L. Nemhauser, L.A. Wolsey, A recursive procedure for generating all cuts for 0-1 mixed integer programs, Math. Programming, 1990.
34. M. Padberg, and G. Rinaldi Optimization of a 532-city symmetric traveling salesman problem by branch and cut Oper. Res. Lett. 6 1 1987 1 7
35. H.D. Sherali, and W.P. Adams A hierarchy of relaxations between continuous and convex hull representations for zero one programming problems SIAM J. Discrete Math. 3 3 1990 411 430
36. H.D. Sherali, and W.P. Adams A reformulation-linearization technique for solving discrete and continuous nonconvex problems 1999 Kluwer Academic Publishers Dordrecht
37. M. Stoer, and G. Dahl A polyhedral approach to multicommodity survivable network design Numer. Math. 68 1 1994 149 167
38. K. Andersen, G. Cornuejols, Y. Li, Reduce-and-split cuts: Improving the performance of mixed integer Gomory cuts, Management Science (2005), to appear.
39. P. Bonami, M. Minoux, Exact MAX-2SAT solution via lift and project closure, OR Letters (2005), to appear.