Lifting and separation procedures for the cut polytope

Mathematical Programming

Volumn 146, Issue 1-2, 2014, Pages 351-378

  Bonato, Thorsten ^a   Jünger, Michael ^b   Reinelt, Gerhard ^a   Rinaldi, Giovanni ^c  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b UNIVERSITY OF COLOGNE   (Germany)

^c CNR   (Italy)

Author keywords

Branch and cut; Cut polytope; Ising spin glass model; Max cut problem; Separation algorithm; Unconstrained boolean quadratic programming

Indexed keywords

GRAPH THEORY; INTEGER PROGRAMMING; QUADRATIC PROGRAMMING;

BRANCH-AND-CUT; CUT POLYTOPE; ISING SPIN-GLASS MODEL; MAX-CUT PROBLEM; SEPARATION ALGORITHMS;

ALGORITHMS;

EID: 84905380039     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-013-0688-2     Document Type: Article

References (30)

1. Anjos, M.; Lasserre, J. (eds.): Handbook on Semidefinite, Conic and Polynomial Optimization. Springer, Berlin (2012)
2. Applegate, D.L.; Bixby, R.E.; Chvátal, V.; Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
3. Avis, D.; Imai, H.; Ito, T.; Sasaki, Y.: Two-party Bell inequalities derived from combinatorics via triangular elimination. J. Phys. A 38, 10971-10987 (2005)
4. Avis, D.; Imai, H.; Ito, T.: Generating facets for the cut polytope of a graph by triangular elimination. Math. Program. 112, 303-325 (2008)
5. Avis, D.; Ito, T.: New classes of facets for the cut polytope and tightness of Imm 22 Bell inequalities. Discrete Appl. Math. 155, 1689-1699 (2007)
6. Barahona, F.: On cuts and matchings in planar graphs. Math. Program. 60, 53-68 (1993)
7. Barahona, F.; Mahjoub, A.R.: On the cut polytope. Math. Program. 36, 157-173 (1986)
8. Barahona, F.; Grötschel, M.; Jünger, M.; Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36, 493-513 (1988)
9. Boros, E.; Hammer, P.L.: Cut-polytopes, boolean quadric polytopes and nonnegative quadratic pseudo-boolean functions. Math. Oper. Res. 18, 245-253 (1993)
10. Buchheim, C.; Liers, F.; Oswald, M.: Local cuts revisited. Oper. Res. Lett. 36, 430-433 (2008)
11. Cheng, E.: Separating subdivision of bicycle wheel inequalities over cut polytopes. Oper. Res. Lett. 23, 13-19 (1998)
12. De Simone, C.: Lifting facets of the cut polytope. Oper. Res. Lett. 9, 341-344 (1990)
13. De Simone, C.; Rinaldi, G.: A cutting plane algorithm for the max-cut problem. Optim. Methods Softw. 3, 195-214 (1994)
14. De Simone, C.; Diehl, M.; Jünger, M.; Mutzel, P.; Reinelt, G.; Rinaldi, G.: Exact ground states of Ising spin glasses: new experimental results with a branch and cut algorithm. J. Stat. Phys. 80, 487-496 (1995)
15. De Simone, C.; Diehl, M.; Jünger, M.; Mutzel, P.; Reinelt, G.; Rinaldi, G.: Exact ground states of two-dimensional ± J Ising spin glasses. J. Stat. Phys. 84, 1363-1371 (1996)
16. Deza, M.M.; Laurent, M.: Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol. 15. Springer, Berlin (1997)
17. Gerards, A.M.H.: Testing the odd bicycle wheel inequalities for the bipartite subgraph polytope. Math. Oper. Res. 10, 359-360 (1985)
18. Goemans, M.X.; Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115-1145 (1995)
19. Helmberg, C.; Rendl, F.; Vanderbei, R.J.; Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342-361 (1996)
20. Jünger, M.; Thienel, S.: The ABACUS system for branch-and-cut-and- price algorithms in integer programming and combinatorial optimization. Softw Pract Exp 30, 1325-1352 (2000)
21. Laurent, M.; Poljak, S.: One-third-integrality in the max-cut problem. Math. Program. 71, 29-50 (1995)
22. Liers, F.: Contributions to Determining Exact Ground-States of Ising Spin-Glasses and to their Physics. PhD Thesis, University of Cologne (2004)
23. Liers, F.; Jünger, M.; Reinelt, G.; Rinaldi, G.: Computing exact ground states of hard Ising spin glass problems by branch-and-cut. In: Hartmann, A.; Rieger, H. (eds.) New Optim. Algorithms Phys.; pp. 47-70. Wiley-VCH, London (2004)
24. Mannino, C.: Personal communication (2011)
25. Marsaglia, G.; Bray, T.A.: A convenient method for generating normal variables. SIAM Rev. 6, 260-264 (1964)
26. Poljak, S.; Tuza, Z.: Maximum cuts and large bipartite subgraphs. In: Cook, W. et al. (eds.) Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 20, pp. 181-244 (1995)
27. Rendl, F.; et al.: Semidefinite relaxations for integer programming. In: Jünger, M. et al. (eds.) 50 years of Integer Programming 1958-2008: The Early Years and State-of-the-Art Surveys, pp. 687-726. Springer, Berlin (2010)
28. Rendl, F.; Rinaldi, G.; Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121, 307-335 (2010)
29. Rinaldi, G.: Rudy: a graph generator. http://www-user.tu-chemnitz.de/ ~helmberg/rudy.tar.gz (1998)
30. Wiegele, A.: BiqMac library. biqmac.uni-klu.ac.at/biqmaclib.html (2007)