Skip to main content
Springer Nature Link
Log in

Cutset Inequalities for Robust Network Design

  • Conference paper
Network Optimization (INOC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6701))

Included in the following conference series:

  • 3434 Accesses

Abstract

Robust optimization is an emerging approach in integer programming taking data uncertainty into account. Recently, the adjustable Γ-robustness approach of Bertsimas and Sim [3, 4] has been applied to network design problems. In this paper, we consider this so-called Γ-robust network design problem. We investigate its polyhedral structure and present robust versions of the cutset inequalities as well as computational results on their effectiveness.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Abilene Internet2 Network, www.internet2.edu/network

  2. Altin, A., Amaldi, E., Belotti, P., Pinar, M.Ç.: Provisioning virtual private networks under traffic uncertainty. Networks 49(1), 100–155 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Prog. Ser. B 98, 49–71 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bertsimas, D., Sim, M.: The Price of Robustness. Operations Research 52(1), 35–53 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bienstock, D., Chopra, S., Günlük, O., Tsai, C.Y.: Minimum cost capacity installation for multicommodity network flows. Math. Prog. 81, 177–199 (1998)

    MathSciNet  MATH  Google Scholar 

  6. IBM CPLEX version 12.1 (2009), http://www.ibm.com

  7. Deutsche Forschungsnetz (DFN), http://www.dfn.de

  8. GÉANT – the pan-european research and education network (2000–2005), http://www.geant.net

  9. Günlük, O.: A branch and cut algorithm for capacitated network design problems. Math. Prog. 86, 17–39 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Koster, A.M.C.A., Kutschka, M., Raack, C.: On the robustness of optimal network designs. In: Proceedings IEEE International Conference on Communications, ICC 2011 (to appear 2011)

    Google Scholar 

  11. Koster, A.M.C.A., Kutschka, M., Raack, C.: Towards Robust Network Design using Integer Linear Programming Techniques. In: Proceedings Next Generation Internet, NGI 2010. IEEE Xplore (2010), http://dx.doi.org/10.1109/NGI.2010.5534462

  12. Magnanti, T.L., Mirchandani, P.: Shortest paths, single origin-destination network design and associated polyhedra. Networks 33, 103–121 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  13. Orlowski, S., Wessäly, R., Pióro, M., Tomaszewski, A.: SNDlib 1.0–Survivable Network Design Library. Networks 55, h276–h286 (2009)

    Google Scholar 

  14. Raack, C., Koster, A.M.C.A., Orlowski, S., Wessaely, R.: On cut-based inequalities for capacitated network design polyhedra. Networks 57, 141–156 (2010)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl II für Mathematik, RWTH Aachen University, Wüllnerstr. 5b, 52062, Aachen, Germany

    Arie M. C. A. Koster & Manuel Kutschka

  2. Zuse Institute Berlin (ZIB), Takustr. 7, 14195, Berlin, Germany

    Christian Raack

Authors
  1. Arie M. C. A. Koster
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manuel Kutschka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Raack
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Systems, University of Hamburg, Von-Melle-Park 5, 20146, Hamburg, Germany

    Julia Pahl  & Stefan Voß  & 

  2. School of Information Systems, Curtin University, 6845, Perth, WA, Australia

    Torsten Reiners

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koster, A.M.C.A., Kutschka, M., Raack, C. (2011). Cutset Inequalities for Robust Network Design. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21527-8_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21526-1

  • Online ISBN: 978-3-642-21527-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics