A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
- 247 Downloads
The minimum k-partition (MkP) problem is the problem of partitioning the set of vertices of a graph into k disjoint subsets so as to minimize the total weight of the edges joining vertices in the same partition. The main contribution of this paper is the design and implementation of a branch-and-cut algorithm based on semidefinite programming (SBC) for the MkP problem. The two key ingredients for this algorithm are: the combination of semidefinite programming with polyhedral results; and a novel iterative clustering heuristic (ICH) that finds feasible solutions for the MkP problem. We compare ICH to the hyperplane rounding techniques of Goemans and Williamson and of Frieze and Jerrum, and the computational results support the conclusion that ICH consistently provides better feasible solutions for the MkP problem. ICH is used in our SBC algorithm to provide feasible solutions at each node of the branch-and-bound tree. The SBC algorithm computes globally optimal solutions for dense graphs with up to 60 vertices, for grid graphs with up to 100 vertices, and for different values of k, providing a fast exact approach for k≥3.
KeywordsMinimum k-partition Semidefinite programming Branch-and-cut Polyhedral cuts
Unable to display preview. Download preview PDF.
- Biq Mac solver. (2007). http://biqmac.uni-klu.ac.at/.
- Deza, M., & Laurent, M. (1997). Algorithms and combinatorics. Geometry of cuts and metrics. Berlin: Springer. Google Scholar
- Deza, M., Grötschel, M., & Laurent, M. (1991). Complete descriptions of small multicut polytopes. Applied Geometry and Discrete Mathematics—The Victor Klee Festschrift, 4, 205–220. Google Scholar
- Eisenblätter, A. (2002). The semidefinite relaxation of the k-partition polytope is strong. In Proceedings of the 9th international IPCO conference on integer programming and combinatorial optimization (Vol. 2337, pp. 273–290). Google Scholar
- Ghaddar, B. (2007). A branch-and-cut algorithm based on semidefinite programming for the minimum k -partition problem. Master’s thesis, University of Waterloo Google Scholar
- Kaibel, V., Peinhardt, M., & Pfetsch, M. E. (2007). Orbitopal fixing. In M. Fischetti & D. P. Williamson (Eds.), Lecture notes in computer science : Vol. 4513. IPCO (pp. 74–88). Berlin: Springer. Google Scholar
- Lee, L. W., Katzgraber, H. G., & Young, A. P. (2006). Critical behavior of the three- and ten-state short-range Potts glass: A Monte Carlo study. Physical Review B, 74, 104–116. Google Scholar
- Mitchell, J. (2001). Branch-and-cut for the k -way equipartition problem (Technical report). Department of Mathematical Sciences, Rensselaer Polytechnic Institute. Google Scholar
- Rinaldi, G. (1996). Rudy. http://www-user.tu-chemnitz.de/~helmberg/rudy.tar.gz.
- Spin-glass server. (1996). http://www.informatik.uni-koeln.de/ls_juenger/research/sgs/index.html.
- Wiegele, A. (2006). Nonlinear optimization techniques applied to combinatorial optimization problems. Ph.D. thesis, Alpen-Adria-Universität Klagenfurt. Google Scholar