Skip to main content
SpringerLink
Log in

LP-based Genetic Algorithm for the Minimum Graph Bisection Problem

  • Conference paper
Operations Research Proceedings 2005

Part of the book series: Operations Research Proceedings ((ORP,volume 2005))

  • 1224 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Achterberg. SCIP-a framework to integrate constraint and mixed integer programming. ZIB-Report, 2004.

    Google Scholar 

  2. F. Barahona and A. R. Mahjoub. On the cut polytope. Math. Programming, 36(2):157–173, 1986.

    MATH  MathSciNet  Google Scholar 

  3. T. N. Bui and B. R. Moon. Genetic algorithm and graph partitioning. IEEE Trans. Comput., 45(7):841–855, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. C. E. Ferreira, A. Martin, C. C. de Souza, R. Weismantel, and L. A. Wolsey. Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Programming, 74:247–267, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  5. C. E. Ferreira, A. Martin, C. C. de Souza, R. Weismantel, and L. A. Wolsey. The node capacitated graph partitioning problem: A computational study. Math. Programmming, 81(2):229–256, 1998.

    Article  MATH  Google Scholar 

  6. M. R. Garey and D. S. Johnson. Computers and Intractability. W.H. Freeman and Company, 1979.

    Google Scholar 

  7. H. H. Hoos and T. Stützle. Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (CA), 2004.

    Google Scholar 

  8. M. Jünger, A. Martin, G. Reinelt, and R. Weismantel. Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. Math. Programmming B, 63(3):257–279, 1994.

    Article  MATH  Google Scholar 

  9. K. Kohmoto, K. Katayaman, and H. Narihisa. Performance of a genetic algorithm for the graph partitioning problem. Math. Comput. Modelling, 38(11–13): 1325–1333, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  10. H. Maini, K. Mehrotra, C. Mohan, and S. Ranka. Genetic algorithms for graph partitioning and incremental graph partitioning. In Supercomputing’ 94: Proceedings of the 1994 ACM/IEEE conference on Supercomputing, pages 449–457, New York, NY, USA, 1994. ACM Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Chemnitz University of Technology, D-09107, Chemnitz, Germany

    Michael Armbruster & Christoph Helmberg

  2. Department of Mathematics, Darmstadt University of Technology, D-64289, Darmstadt, Germany

    Marzena Fügenschuh, Nikolay Jetchev & Alexander Martin

Authors
  1. Michael Armbruster
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marzena Fügenschuh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christoph Helmberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nikolay Jetchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Alexander Martin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Shipping Economics and Logistics Dept. Logistics Systems, University of Bremen, Universitätsallee GW1 Block A, 28359, Bremen, Germany

    Hans-Dietrich Haasis

  2. Faculty of Business Studies and Economics Chair of Logistics, University of Bremen, PO Box 33 04 40, 28334, Bremen, Germany

    Herbert Kopfer  & Jörn Schönberger  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Armbruster, M., Fügenschuh, M., Helmberg, C., Jetchev, N., Martin, A. (2006). LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_50

Download citation

Publish with us

Policies and ethics

Search

Navigation