Formulations and valid inequalities for the node capacitated graph partitioning problem

Mathematical Programming, Series B

Volumn 74, Issue 3, 1996, Pages 247-266

  Ferreira, C E ^a   Martin, A ^b   De Souza, C C ^d   Weismantel, R ^b   Wolsey, L A ^c  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b ZUSE INSTITUTE BERLIN   (Germany)

^c UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^d NONE

Author keywords

Clustering; Ear decomposition; Equipartition; Graph partitioning; Integer programming; Knapsack

Indexed keywords

EID: 0039049518     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592198     Document Type: Article

References (17)

1. E.H. Aghezzaf, "Optimal constrained rooted subtrees and partitioning problems on tree graphs," Doctoral Thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium (1992).
2. 5," Operations Research Letters 2 (1983) 107-111.
3. F. Barahona and A.R. Mahjoub, "On the cut polytope," Mathematical Programming 36 (1986) 157-173.
4. S. Chopra and M.R. Rao, "The partition problem," Mathematical Programming 59 (1993) 87-116.
5. M. Conforti, M.R. Rao and A. Sassano, "The equipartition polytope I," Mathematical Programming 49 (1990) 49-70.
6. M. Conforti, M.R. Rao and A. Sassano, "The equipartition polytope II," Mathematical Programming 49 (1990) 71-90.
7. 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.
8. M. Grötschel and Y. Wakabayashi, "Facets of the clique partitioning polytope," Mathematical Programming 47 (1990) 367-387.
9. M. Grötschel and Y. Wakabayashi, "A cutting plane algorithm for a clustering problem," Mathematical Programming 45 (1989) 59-96.
10. E. Johnson, A. Mehrotra and G.L. Nemhauser, "Min-cut clustering," Mathematical Programming 62 (1993) 133-152.
11. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout (Wiley, New York, 1990).
12. L. Lovasz and M.D. Plummer, "Matching theory," in: Annals of Discrete Mathematics 29 (North-Holland, Amsterdam, 1986).
13. C.C. de Souza, "The graph equipartition problem: Optimal solutions, extensions and applications," Doctoral Thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium (1993).
14. C.C. de Souza and M. Laurent, "Some new classes of facets for the equicut polytope," Discrete Applied Mathematics 62 (1995) 167-191.
15. 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).
16. 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).
17. H. Whitney, "Non-separable and planar graphs," Transactions of the American Mathematical Society 34 (1932) 339-362.