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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abilene Internet2 Network, www.internet2.edu/network
Altin, A., Amaldi, E., Belotti, P., Pinar, M.Ç.: Provisioning virtual private networks under traffic uncertainty. Networks 49(1), 100–155 (2007)
Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Prog. Ser. B 98, 49–71 (2003)
Bertsimas, D., Sim, M.: The Price of Robustness. Operations Research 52(1), 35–53 (2004)
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)
IBM CPLEX version 12.1 (2009), http://www.ibm.com
Deutsche Forschungsnetz (DFN), http://www.dfn.de
GÉANT – the pan-european research and education network (2000–2005), http://www.geant.net
Günlük, O.: A branch and cut algorithm for capacitated network design problems. Math. Prog. 86, 17–39 (1999)
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)
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
Magnanti, T.L., Mirchandani, P.: Shortest paths, single origin-destination network design and associated polyhedra. Networks 33, 103–121 (1993)
Orlowski, S., Wessäly, R., Pióro, M., Tomaszewski, A.: SNDlib 1.0–Survivable Network Design Library. Networks 55, h276–h286 (2009)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)