The Node Capacitated Graph Partitioning Problem: A Computational Study

Carlos E. Ferreira, Cid C. de SOUZA, Alexander Martin and Robert Weismantel
Additional contact information
Carlos E. Ferreira: Universidade de Sao Paulo, Brazil
Cid C. de SOUZA: Universidade Estadual de Capinas, Brazil
Alexander Martin: Konrad-Zuse-Zentrum für Informationstechnik Berlin
Robert Weismantel: Konrad-Zuse-Zentrum für Informationstechnik Berlin

No 1994053, LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Abstract: In this paper we consider the problem of k-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the objective of minimizing the sum of the costs of the edges between the subsets of the partition. Based on a study of valid inequalities, we present a variety of separation heuristics for cycle, cycle with ears, knapsack tree and path-block-cycle inequalities among others. The separation heuristics, plus primal heuristics, have been implemented in a branch-and-cut routine using a formulation including variables for the edges with nonzero costs and node partition variables. Results are presented for three classes of problems: equipartitioning problems arising in finite element methods and partitioning problems associated with electronic circuit layout and compiler design.

Keywords: branch-and-cut algorithm; clustering; compiler design; equipartitioning; finite element method; graph partitioning; layout of electronic circuits; separation heuristics (search for similar items in EconPapers)
Date: 1994-10-01
References: Add references at CitEc
Citations:

Downloads: (external link)
https://sites.uclouvain.be/core/publications/coredp/coredp1994.html (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvco:1994053

Access Statistics for this paper

More papers in LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().