Abstract
We investigate the problem of partitioning the nodes of a graph under capacity restriction on the sum of the node weights in each subset of the partition. The objective is to minimize the sum of the costs of the edges between the subsets of the partition. This problem has a variety of applications, for instance in the design of electronic circuits and devices. We present alternative integer programming formulations for this problem and discuss the links between these formulations. Having chosen to work in the space of edges of the multicut, we investigate the convex hull of incidence vectors of feasible multicuts. In particular, several classes of inequalities are introduced, and their strength and robustness are analyzed as various problem parameters change.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E.H. Aghezzaf, “Optimal constrained rooted subtrees and partitioning problems on tree graphs,” Doctoral Thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium (1992).
F. Barahona, “The max-cut problem in graphs not contractible toK 5”Operations Research Letters 2 (1983) 107–111.
F. Barahona and A.R. Mahjoub, “On the cut polytope,”Mathematical Programming 36 (1986) 157–173.
S. Chopra and M.R. Rao, “The partition problem,”Mathematical Programming 59 (1993) 87–116.
M. Conforti, M.R. Rao and A. Sassano, “The equipartition polytope I,”Mathematical Programming 49 (1990) 49–70.
M. Conforti, M.R. Rao and A. Sassano, “The equipartition polytope II,”Mathematical Programming 49 (1990) 71–90.
C.E. Ferreira, A. Martin, C.C. de Souza, R. Weismantel and L.A. Wolsey, “The node capacitated graph partitioning problem: A computational study, submitted.
M. Grötschel and Y. Wakabayashi, “Facets of the clique partitioning polytope,”Mathematical Programming 47 (1990) 367–387.
M. Grötschel and Y. Wakabayashi, “A cutting plane algorithm for a clustering problem,”Mathematical Programming 45 (1989) 59–96.
E. Johnson, A. Mehrotra and G.L. Nemhauser, “Min-cut clustering,”Mathematical Programming 62 (1993) 133–152.
T. Lengauer,Combinatorial Algorithms for Integrated Circuit Layout (Wiley, New York, 1990).
L. Lovasz and M.D. Plummer, “Matching theory,” inAnnals of Discrete Mathematics 29 (North-Holland, Amsterdam, 1986).
C.C. de Souza, “The graph equipartition problem: Optimal solutions, extensions and applications,” Doctoral Thesis, Université Catholique de Louvain Louvain-la-Neuve, Belgium (1993).
C.C. de Souza and M. Laurent, “Some new classes of facets for the equicut polytope,”Discrete Applied Mathematics 62 (1995) 167–191.
F. Vanderbeck, “Decomposition and column generation for integer programs,” Doctoral Thesis, Faculté des Sciences Appliquées, Université Catholique de Louvain, Louvain-la-Neuve, Belgium (1994).
R. Weismantel, “Plazieren von Zellen: Theorie and Lösung eines quadratischen 0–1 Optimierungsproblem,” Technical Report TR 92-3, Konrad-Zuse-Zentrum für Informationstechnik, Berlin (1993).
H. Whitney, “Non-separable and planar graphs,”Transactions of the American Mathematical Society 34 (1932) 339–362.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ferreira, C.E., Martin, A., de Souza, C.C. et al. Formulations and valid inequalities for the node capacitated graph partitioning problem. Mathematical Programming 74, 247–266 (1996). https://doi.org/10.1007/BF02592198
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02592198