Abstract
Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is possible to exploit structural properties of the underlying problem and to apply, even to sparse large scale instances, cutting plane methods, probably the most successful technique in linear programming. We set up a common branch-and-cut framework for linear and semidefinite relaxations of the minimum graph bisection problem. It incorporates separation algorithms for valid inequalities presented in the recent study [2] of the facial structure of the associated polytope. Extensive numerical experiments show that the semidefinite branch-and-cut approach outperforms the classical simplex approach on a clear majority of the sparse large scale test instances. On instances from compiler design the simplex approach is faster.
This is a preview of subscription content, log in via an institution to check access.
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
Achterberg, T.: Constraint integer programming. PhD-Thesis, PhD-Thesis, Technische Universität Berlin, Berlin (2007)
Armbruster, M., Fügenschuh, M., Helmberg, C., Martin, A.: On the bisection cut polytope. Technical Report, Chemnitz/Darmstadt University of Technology (2007)
Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Prog. 36, 157–173 (1986)
Conforti, M., Rao, M.R., Sassano, A.: The equipartition polytope I, II. Math. Prog. 49, 49–70 (1990)
de Souza, C.C.: The graph equipartition problem: Optimal solutions, extensions and applications. PhD-Thesis, Université Catholique de Louvain, Belgium (1993)
Deza, M., Laurent, M.: Geometry of Cuts and Metrics Algorithms and Combinatorics, vol. 15. Springer, Heidelberg (1997)
Eisenblätter, A.: Frequency Assignment in GSM Networks. PhD-Thesis, Technische Universität Berlin, Berlin (2001)
Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Prog. 74, 247–266 (1996)
Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, New York (1979)
Gilbert, J.R., Tarjan, R.E.: The analysis of a nested dissection algorithm. Numer. Math. 50, 377–404 (1979)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115–1145 (1995)
Helmberg, C.: A cutting plane algorithm for large scale semidefinite relaxations. In: Grötschel, M. (ed.) The Sharpest Cut. MPS-SIAM Series on Optimization, pp. 233–256 (2004)
Helmberg, C., Kiwiel, K.C.: A Spectral Bundle Method with Bounds. Math. Prog. 93, 173–194 (2002)
Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3), 673–696 (2000)
Laurent, M., de Souza, C.C.: Some new classes of facets for the equicut polytope. Discr. App. Math. 62, 167–191 (1995)
Johnson, E., Mehrotra, A., Nemhauser, G.: Min-cut clustering. Math. Prog. 62, 133–152 (1993)
Jünger, M., Martin, A., Reinelt, G., Weismantel, R.: Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. Math. Prog. B 63(3), 257–279 (1994)
Lengauer, T.: Combinatorial algorithms for integrated circuit layout. John Wiley and Sons Ltd., Chichester (1990)
Poljak, S., Rendl, F.: Nonpolyhedral relaxations of graph-bisection problems. SIAM J. Optim. 5(3), 467–487 (1995)
Rendl, F., Rinaldi, G., Wiegele, A.: A branch and bound algorithm for Max-Cut based on combining semidefinite and polyhedral relaxations. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 295–309. Springer, Heidelberg (2007)
Weismantel, R.: On the 0/1 Knapsack polytope. Math. Prog. 77, 49–68 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Armbruster, M., Fügenschuh, M., Helmberg, C., Martin, A. (2008). A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2008. Lecture Notes in Computer Science, vol 5035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68891-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-68891-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68886-0
Online ISBN: 978-3-540-68891-4
eBook Packages: Computer ScienceComputer Science (R0)