Abstract
In this paper we present a method for finding exact solutions of the Max-Cut problem max x T Lx such that x ∈ { − 1,1}n. We use a semidefinite relaxation combined with triangle inequalities, which we solve with the bundle method. This approach is due to [12] and uses Lagrangian duality to get upper bounds with reasonable computational effort. The expensive part of our bounding procedure is solving the basic semidefinite programming relaxation of the Max-Cut problem.
We review other solution approaches and compare the numerical results with our method. We also extend our experiments to unconstrained quadratic 0-1 problems and to instances of the graph bisection problem.
The experiments show, that our method nearly always outperforms all other approaches. Our algorithm, which is publicly accessible through the Internet, can solve virtually any instance with about 100 variables in a routine way.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Supported in part by the EU project Algorithmic Discrete Optimization (ADONET), MRTN-CT-2003-504438.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barahona, F., Ladányi, L.: Branch and cut based on the volume algorithm: Steiner trees in graphs and max-cut. RAIRO Oper. Res. 40(1), 53–73 (2006)
Barahona, F., Grötschel, M., Jünger, M., Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Operations Research 36, 493–513 (1988)
Barahona, F., Jünger, M., Reinelt, G.: Experiments in quadratic 0-1 programming. Math. Programming, Ser. A 44(2), 127–137 (1989)
Beasley, J.E.: Or-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069–1072 (1990)
Beasley, J.E.: Or-library (1990), http://people.brunel.ac.uk/~mastjjb/jeb/info.html
Beasley, J.E.: Heuristic algorithms for the unconstrained binary quadratic programming problem. Technical report, The Management School, Imperial College, London, England (1998)
Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem. Math. Programming, Ser. A 109(1), 55–68 (2007)
Boros, E., Hammer, P.L., Tavares, G.: The pseudo-boolean optimization website (2005), http://rutcor.rutgers.edu/~pbo/
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. Statist. Phys. 80(1-2), 487–496 (1995)
Delorme, C., Poljak, S.: Laplacian eigenvalues and the maximum cut problem. Math. Programming, Ser. A 62(3), 557–574 (1993)
Elf, M., Jünger, M., Rinaldi, G.: Minimizing breaks by maximizing cuts. Operations Research Letters 31, 343–349 (2003)
Fischer, I., Gruber, G., Rendl, F., Sotirov, R.: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition. Math. Programming, Ser. B 105(2-3), 451–469 (2006)
Frangioni, A., Lodi, A., Rinaldi, G.: New approaches for optimizing over the semimetric polytope. Math. Program., Ser. B 104(2-3), 375–388 (2005)
Glover, F., Kochenberger, G., Alidaee, B.: Adaptative memory tabu search for binary quadratic programs. Management Sci 44(3), 336–345 (1998)
Goemans, M.X., Williamson, D.P.: 878-approximation algorithms for max cut and max 2sat. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, Montreal, Quebec, Canada, pp. 422–431 (1994)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42(6), 1115–1145 (1995), preliminary version see: Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, Montreal, Quebec, Canada, pp. 422–431 (1994)
Helmberg, C.: Fixing variables in semidefinite relaxations. SIAM J. Matrix Anal. Appl. (electronic) 21(3), 952–969 (2000)
Helmberg, C., Rendl, F.: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. Math. Programming, Ser. A 82(3), 291–315 (1998)
Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation. part i, graph partitioning. Oper. Res. 37(6), 865–892 (1989)
Karisch, S.E., Rendl, F.: Semidefinite programming and graph equipartition. In: Topics in semidefinite and interior-point methods, Toronto, ON, 1996. Fields Inst. Commun, vol. 18, pp. 77–95. Amer. Math. Soc., Providence (1998)
Kim, S., Kojima, M.: Second order cone programming relaxation of nonconvex quadratic optimization problems. Optim. Methods Softw. 15(3-4), 201–224 (2001)
Liers, F.: Contributions to Determining Exact Ground-States of Ising Spin-Glasses and to their Physics. PhD thesis, Universität zu Köln (2004)
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 Optimization Algorithms in Physics, pp. 47–68. Wiley, Chichester (2004)
Muramatsu, M., Suzuki, T.: A new second-order cone programming relaxation for MAX-CUT problems. J. Oper. Res. Soc. Japan 46(2), 164–177 (2003)
Pardalos, P.M., Rodgers, G.P.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45(2), 131–144 (1990)
Pardalos, P.M., Rodgers, G.P.: Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture. Ann. Oper. Res. 22(1-4), 271–292 (1990)
Poljak, S., Rendl, F.: Solving the max-cut problem using eigenvalues. Discrete Appl. Math. 62(1-3), 249–278 (1995)
Poljak, S., Rendl, F.: Nonpolyhedral relaxations of graph-bisection problems. SIAM J. Optim. 5(3), 467–487 (1995)
Rendl, F., Rinaldi, G., Wiegele, A.: Biq Mac – a solver for binary quadratic and max-cut problems (2006), http://BiqMac.uni-klu.ac.at/
Rinaldi, G.: Rudy (1998), http://www-user.tu-chemnitz.de/~helmberg/rudy.tar.gz
Wiegele, A.: Nonlinear optimization techniques applied to combinatorial optimization problems. PhD thesis, Alpen-Adria-Universität Klagenfurt (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Rendl, F., Rinaldi, G., Wiegele, A. (2007). A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations. In: Fischetti, M., Williamson, D.P. (eds) Integer Programming and Combinatorial Optimization. IPCO 2007. Lecture Notes in Computer Science, vol 4513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72792-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-72792-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72791-0
Online ISBN: 978-3-540-72792-7
eBook Packages: Computer ScienceComputer Science (R0)