IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/1994053.html
   My bibliography  Save this paper

The Node Capacitated Graph Partitioning Problem : A Computational Study

Author

Listed:
  • FERREIRA, Carlos E.

    (Universidade de Sao Paulo, Brazil)

  • de SOUZA, Cid C.

    (Universidade Estadual de Capinas, Brazil)

  • MARTIN, Alexander

    (Konrad-Zuse-Zentrum für Informationstechnik Berlin)

  • WEISMANTEL, Robert

    (Konrad-Zuse-Zentrum für Informationstechnik Berlin)

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.

Suggested Citation

  • FERREIRA, Carlos E. & de SOUZA, Cid C. & MARTIN, Alexander & WEISMANTEL, Robert, 1994. "The Node Capacitated Graph Partitioning Problem : A Computational Study," LIDAM Discussion Papers CORE 1994053, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  • Handle: RePEc:cor:louvco:1994053
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp1994.html
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cor:louvco:1994053. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.