Skip to main content
SpringerLink
Log in

Problemdekomposition durch Graphenpartitionierung

  • Chapter
  • First Online:
Zukunftsperspektiven des Operations Research

  • 4286 Accesses

Zusammenfassung

Die zunehmende Parallelverarbeitungsfähigkeit von Computern macht eine Zerlegung von Optimierungsproblemen in Teilaufgaben interessant, die von verschiedenen Prozessoren oder Kernen parallel bearbeitet werden können.

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 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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.

Literaturverzeichnis

  • D. A. Bader, H. Meyerhenke, P. Sanders und D. Wagner, Hrsg. Graph Partitioning and Graph Clustering - 10th DIMACS Implementation Challenge Workshop. Proceedings, Band 588 der Reihe Contemporary Mathematics, 2013. American Mathematical Society.

    Google Scholar 

  • P. Galinier, Z. Boujbel und M.C. Fernandes. An efficient memetic algorithm for the graph partitioning problem. Annals of Operations Research, 191(1):1–22, 2011.

    Article  Google Scholar 

  • A.J. Soper, C. Walshaw und M: Cross. A combined evolutionary search and multilevel optimisation approach to graph-partitioning. J. Global Optimization, 29(2):225–241, 2004.

    Google Scholar 

  • C. Walshaw. The graph partitioning archive, 2014. URL http://staffweb.cms.gre.ac.uk/wc06/partition. Zugegriffen am 30. Januar.

Download references

Author information

Authors and Affiliations

  1. Geschäftsbereich Logistik, INFORM GmbH, Pascalstr. 23, 52076, Aachen, Deutschland

    Frank Schneider Dipl. Inf.

  2. Zentrale Entwicklung, INFORM GmbH, Pascalstr. 23, 52076, Aachen, Deutschland

    Dr. Ulrich Dorndorf

Authors
  1. Frank Schneider Dipl. Inf.
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dr. Ulrich Dorndorf
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Frank Schneider Dipl. Inf. .

Editor information

Editors and Affiliations

  1. Lehrstuhl für Operations Research, RWTH Aachen, Aachen, Germany

    Marco Lübbecke

  2. Geschäftsleitung, INFORM GmbH, Aachen, Germany

    Adrian Weiler

  3. Lehrstuhl für Betriebswirtschaftslehre, Ruhr-Universität Bochum, Bochum, Germany

    Brigitte Werners

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Fachmedien Wiesbaden

About this chapter

Cite this chapter

Schneider, F., Dorndorf, U. (2014). Problemdekomposition durch Graphenpartitionierung. In: Lübbecke, M., Weiler, A., Werners, B. (eds) Zukunftsperspektiven des Operations Research. Springer Gabler, Wiesbaden. https://doi.org/10.1007/978-3-658-05707-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-658-05707-7_5

  • Published:

  • Publisher Name: Springer Gabler, Wiesbaden

  • Print ISBN: 978-3-658-05706-0

  • Online ISBN: 978-3-658-05707-7

  • eBook Packages: Business and Economics (German Language)

Publish with us

Policies and ethics

Search

Navigation