IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-32539-0_50.html
   My bibliography  Save this book chapter

LP-based Genetic Algorithm for the Minimum Graph Bisection Problem

In: Operations Research Proceedings 2005

Author

Listed:
  • Michael Armbruster

    (Chemnitz University of Technology)

  • Marzena Fügenschuh

    (Darmstadt University of Technology)

  • Christoph Helmberg

    (Chemnitz University of Technology)

  • Nikolay Jetchev

    (Darmstadt University of Technology)

  • Alexander Martin

    (Darmstadt University of Technology)

Abstract

Summary We investigate the minimum graph bisection problem concerning partitioning the nodes of a graph into two subsets such that the total weight of each set is within some lower and upper limits. The objective is to minimize the total cost of edges between both subsets of the partition. This problem has a variety of applications, for instance in the design of electronic circuits and in parallel computing. We present an integer linear programming formulation for this problem. We develop a primal heuristic based on a genetic algorithm, incorporate it in a branch-and-cut framework and present some computational results.

Suggested Citation

  • Michael Armbruster & Marzena Fügenschuh & Christoph Helmberg & Nikolay Jetchev & Alexander Martin, 2006. "LP-based Genetic Algorithm for the Minimum Graph Bisection Problem," Operations Research Proceedings, in: Hans-Dietrich Haasis & Herbert Kopfer & Jörn Schönberger (ed.), Operations Research Proceedings 2005, pages 315-320, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-32539-0_50
    DOI: 10.1007/3-540-32539-5_50
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:oprchp:978-3-540-32539-0_50. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.