Skip to main content
SpringerLink
Log in

Netzwerkalgorithmen in der robusten Optimierung

  • Chapter
  • First Online:
Zukunftsperspektiven des Operations Research

  • 4290 Accesses

Zusammenfassung

Robuster Optimierung, gerade in der Kommunikations- und Transportlogistik, wird in den kommenden Jahren immer höhere Bedeutung zukommen. Globalisierung und Internet führen zu immer gößeren, unüberschaubareren und komplexeren Netzwerken, die natürlich auch umso anfälliger gegenüber Störungen sein werden. Ausfälle einzelner Verbindungsstrecken können negative Auswirkungen ungeahnter Ausmaße verursachen.

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

  • Ravindra K. Ahuja, Thomas L. Magnanti und James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.

    Google Scholar 

  • Y. P. Aneja, R. Chandrasekaran und K. P. K. Nair. Maximizing residual flow under an arc destruction. Networks, 38(4):194–198, 2001.

    Google Scholar 

  • Dimitris Bertsimas, Ebrahim Nasrabadi und Sebastian Stiller. Robust and adaptive network flows. Operations Research, 61(5):1218–1242, 2013.

    Article  Google Scholar 

  • Carl Burch, Robert Carr, Sven Krumke, Madhav Marathe, Cynthia Phillips und Eric Sundberg. A decomposition-based pseudoapproximation algorithm for network flow inhibition. In David L. Woodruff, Hrsg., Network Interdiction and Stochastic Integer Programming, Band 22 der Reihe Operations Research/Computer Science Interfaces Series, Seiten 51–68. Springer US, 2003.

    Google Scholar 

  • Rainer E. Burkard, Karin Dlaska und Bettina Klinz. The quickest flow problem. Zeitschrift für Operations Research, 37(1):31–58, 1993.

    Google Scholar 

  • L.R. Ford und Delbert Ray Fulkerson. Flows in networks. Princeton University Press, 1962.

    Google Scholar 

  • S. Thomas McCormick und Thomas R. Ervolina. Computing maximum mean cuts. Discrete Applied Mathematics, 52(1):53–70, 1994.

    Article  Google Scholar 

  • S. Thormas McCormick, Gianpaolo Oriolo und Britta Peis . Discrete newton algorithms for budgeted network problems. Technical report, RWTH Aachen, 2014.

    Google Scholar 

  • Jean-Claude Picard und Maurice Queyranne. On the structure of all minimum cuts in a network and applications. Springer, 1980.

    Google Scholar 

  • R. Tyrrell Rockafellar. Network flows and monotropic optimization. John Wiley & Sons, Inc., New York, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Operations and Logistics Division, Sauder School of Business, Vancouver, Canada

    Prof. Dr. Tom McCormick

  2. Dipartimento di InformaticaInformatica, Sistemi e Produzione, DICH Universitá di Roma Tor Vergata, Roma, Italien

    Prof. Gianpaolo Oriolo Ph.D.

  3. Lehrstuhl für Management Science, RWTH Aachen, Kackertstr. 7, 52072, Aachen, Deutschland

    Prof. Dr. Britta Peis

Authors
  1. Prof. Dr. Tom McCormick
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prof. Gianpaolo Oriolo Ph.D.
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Prof. Dr. Britta Peis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tom McCormick .

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

McCormick, T., Oriolo, G., Peis, B. (2014). Netzwerkalgorithmen in der robusten Optimierung. 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_15

Download citation

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

  • 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