A branch and bound algorithm for max-cut based on combining semidefinite and polyhedral relaxations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4513 LNCS, Issue , 2007, Pages 295-309

  Rendl, Franz ^a   Rinaldi, Giovanni ^b   Wiegele, Angelika ^a  

^a UNIVERSITY OF KLAGENFURT   (Austria)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; INTERNET; LAGRANGE MULTIPLIERS; PROBLEM SOLVING;

POLYHEDRAL RELAXATIONS; SEMIDEFINITE PROGRAMMING RELAXATION; SEMIDEFINITE RELAXATION; UNCONSTRAINED QUADRATIC PROBLEMS;

INTEGER PROGRAMMING;

EID: 38049009910     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72792-7_23     Document Type: Conference Paper

References (31)

1. F. Barahona and L. Ladányi. Branch and cut based on the volume algorithm: Steiner trees in graphs and max-cut. RAIRO Oper. Res., 40(1): 53-73, 2006.
2. F. Barahona, M. Grötschel, M. Jünger, and G. Reinelt. An application of combinatorial optimization to statistical physics and circuit layout design. Operations Research, 36:493-513, 1988.
3. F. Barahona, M. Jünger, and G. Reinelt. Experiments in quadratic 0-1 programming. Math. Programming, 44(2, (Ser. A)):127-137, 1989.
4. J. E. Beasley. Or-library: distributing test problems by electronic mail. J. Oper. Res. Soc., 41(11):1069-1072, 1990.
5. J. E. Beasley. Or-library, 1990. http://people.brunel.ac.uk/~mastjjb/jeb/ info.html.
6. J. E. Beasley. Heuristic algorithms for the unconstrained binary quadratic programming problem. Technical report, The Management School, Imperial College, London SW7 2AZ, England, 1998.
7. A. Billionnet and S. Elloumi. Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem. Math. Programming, 109(1, Ser. A):55-68, 2007.
8. E. Boros, P. L. Hammer, and G. Tavares. The pseudo-boolean optimization website, 2005. http://rutcor.rutgers.edu/~pbo/.
9. C. De Simone, M. Diehl, M. Jünger, P. Mutzel, G. Reinelt, and G. Rinaldi. Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm. J. Statist. Phys., 80(1-2):487-496, 1995.
10. C. Delorme and S. Poljak. Laplacian eigenvalues and the maximum cut problem. Math. Programming, 62(3, Ser. A):557-574, 1993.
11. M. Elf, M. Jünger, and G. Rinaldi. Minimizing breaks by maximizing cuts. Operations Research Letters, 31:343-349, 2003.
12. I. Fischer, G. Gruber, F. Rendi, and R. Sotirov. Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition. Math. Programming, 105(2-3, Ser. B):451-469, 2006.
13. A. Frangioni, A. Lodi, and G. Rinaldi. New approaches for optimizing over the semimetric polytope. Math. Program., 104(2-3, Ser. B):375-388, 2005.
14. F. Glover, G. Kochenberger, and B. Alidaee. Adaptative memory tabu search for binary quadratic programs. Management Sci., 44(3):336-345, 1998.
15. M. X. Goemans and D. P. Williamson. 878-approximation algorithms for max cut and max 2sat. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 422-431, Montreal, Quebec, Canada, 1994.
16. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach., 42(6):1115-1145, 1995. preliminary version see [15].
17. C. Helmberg. Fixing variables in semidefinite relaxations. SIAM J. Matrix Anal. Appl., 21(3):952-969 (electronic), 2000.
18. C. Helmberg and F. Rendl. Solving quadratic (0, 1)-problems by semidefinite programs and cutting planes. Math. Programming, 82(3, Ser. A):291-315, 1998.
19. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. Optimization by simulated annealing: an experimental evaluation. part i, graph partitioning. Oper. Res., 37(6):865-892, 1989.
20. S. E. Karisch and F. Rendl. Semidefinite programming and graph equipartition. In Topics in semidefinite and interior-point methods (Toronto, ON, 1996), volume 18 of Fields Inst. Commun., pages 77-95. Amer. Math. Soc., Providence, RI, 1998.
21. S. Kim and M. Kojima. Second order cone programming relaxation of nonconvex quadratic optimization problems. Optim. Methods Softw., 15 (3-4):201-224, 2001.
22. F. Liers. Contributions to Determining Exact Ground-States of Ising SpinGlasses and to their Physics. PhD thesis, Universität zu Köln, 2004.
23. F. Liers, M. Jünger, G. Reinelt, and G. Rinaldi. Computing exact ground states of hard ising spin glass problems by branch-and-cut. In A. Hartmann and H. Rieger, editors, New Optimization Algorithms in Physics, pages 47-68. Wiley, 2004.
24. M. Muramatsu and T. Suzuki. A new second-order cone programming relaxation for MAX-CUT problems. J. Oper. Res. Soc. Japan, 46(2): 164-177, 2003.
25. P. M. Pardalos and G. P. Rodgers. Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing, 45(2): 131-144, 1990.
26. P. M. Pardalos and G. P. Rodgers. Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture. Ann. Oper. Res., 22(1-4):271-292, 1990.
27. S. Poljak and F. Rendl. Solving the max-cut problem using eigenvalues. Discrete Appl. Math., 62(1-3):249-278, 1995.
28. S. Poljak and F. Rendl. Nonpolyhedral relaxations of graph-bisection problems. SIAM J. Optim., 5(3):467-487, 1995.
29. F. Rendl, G. Rinaldi, and A. Wiegele. Biq Mac - a solver for binary quadratic and max-cut problems, 2006. http://BiqMac.uni-klu.ac.at/.
30. G. Rinaldi. Rudy, 1998. http://www-user.tu-chemnitz.de/~helmberg/rudy. tar.gz.
31. A. Wiegele. Nonlinear optimization techniques applied to combinatorial optimization problems. PhD thesis, Alpen-Adria-Universität Klagenfurt, 2006.