Formulations and valid inequalities for the node capacitated graph partitioning problem
- 250 Downloads
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.
KeywordsClustering Graph partitioning Equipartition Knapsack Integer programming Ear decomposition
Unable to display preview. Download preview PDF.
- E.H. Aghezzaf, “Optimal constrained rooted subtrees and partitioning problems on tree graphs,” Doctoral Thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium (1992).Google Scholar
- 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.Google Scholar
- L. Lovasz and M.D. Plummer, “Matching theory,” inAnnals of Discrete Mathematics 29 (North-Holland, Amsterdam, 1986).Google Scholar
- C.C. de Souza, “The graph equipartition problem: Optimal solutions, extensions and applications,” Doctoral Thesis, Université Catholique de Louvain Louvain-la-Neuve, Belgium (1993).Google Scholar
- 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).Google Scholar
- 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).Google Scholar