A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation

Agarwal, Y.: Design of survivable networks using three- and four-partition facets. Oper. Res. 61(1), 199–213 (2015)

Agarwal, Y.K.: k-partition-based facets of the network design problem. Networks 47(3), 123–139 (2006)

Altın, A., Amaldi, E., Belotti, P., Pınar, M.: Provisioning virtual private networks under traffic uncertainty. Networks 49(1), 100–115 (2007)

Altin, A., Yaman, H., Pinar, M c: The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations. INFORMS J. Comput. 23(1), 75–89 (2011)

Andrade, R., Lisser, A., Maculan, N.: Multi-service multi-facility network design under uncertainty. Ann. Oper. Res. 199(1), 157–178 (2012)

Avella, P., Mattia, S., Sassano, A.: Metric inequalities and the network loading problem. Discrete Optim. 4, 103–114 (2007)

Ayoub, J., Poss, M.: Decomposition for adjustable robust linear optimization subject to uncertainty polytope. Comput. Manag. Sci. 13(2), 219–239 (2016)

Babonneau, F., Vial, J.-P., Klopfenstein, O., Ouorou, A.: Robust capacity assignment solutions for telecommunications networks with uncertain demands. Networks 62(4), 255–272 (2013)

Barahona, F.: Network design using cut inequalities. SIAM J. Optim. 6, 823–834 (1996)

Ben-Ameur, W.: Between fully dynamic routing and robust stable routing. In: Proceedings of DRCN2007, pp. 1–6 (2007)

Ben-Ameur, W., Kerivin, H.: Routing of uncertain traffic demands. Optim. Eng. 6, 283–313 (2005)

Ben-Ameur, W., Zotkiewicz, M.: Volume oriented routing. In: Proceedings of NETWORKS2010), pp. 1–7 (2010)

Ben-Tal, A., Ghaoui, L .E., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)

Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Math. Program. 99(2), 351–376 (2004)

Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 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. Program. 81, 177–199 (1998)

Bienstock, D., Mattia, S.: Using mixed-integer programming to solve power grid blackout problems. Discrete Optim. 4, 115–141 (2007)

Bley, A., Klaehne, R., Menne, U., Raack, C., Wessaely, R.: Multi-layer network design—a model-based optimization approach. In: Proceedings of the PGTS 2008, Berlin, Germany, pp. 107–116 (2008)

Cacchiani, V., Jünger, M., Liers, F., Lodi, A., Schmidt, D.R.: Single-commodity robust network design with finite and hose demand sets. Math. Program. 157(1), 297–342 (2016)

Chekuri, C., Oriolo, G., Scutellà, M., Shepherd, F.: Hardness of robust network design. Networks 50(1), 50–154 (2007)

CPLEX: IBM ILOG CPLEX 12.6 Reference Manual. ILOG CPLEX Division, Gentilly, France (2013)

Duffield, N., Goyal, P., Greenberg, A., Mishra, P., Ramakrishnan, K., van der Merive, J.: A flexible model for resource management in virtual private networks. In: SIGCOMM Computer Communication Review 29(4), 95–108 (1999)

Fingerhut, J., Suri, S., Turner, J.: Designing least-cost nonblocking broadband networks. J. Algorithms 24(2), 287–309 (1997)

Fortz, B., Poss, M.: An improved benders decomposition applied to a multi-layer network design problem. Oper. Res. Lett. 37(5), 359–364 (2009)

Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flows. In: Proceedings of ACMSTOC 2001, pp. 389–398 (2001)

Koster, A., Kutschka, M., Raack, C.: Robust network design: formulations, valid inequalities, and computations. Networks 61(2), 128–149 (2013)

Lee, C., Lee, K., Park, S.: Benders decomposition approach for the robust network design problem with flow bifurcations. Networks 62(1), 1–16 (2013)

Lemaréchal, C., Ouorou, A., Petrou, G.: Robust network design in telecommunications under polytope demand uncertainty. Eur. J. Oper. Res. 206(3), 634–641 (2010)

Magnanti, T., Mirchandani, P., Vachani, R.: The convex hull of two core capacitated network design problems. Math. Program. 60, 233–250 (1993)

Mattia, S.: Separating tight metric inequalities by bilevel programming. Oper. Res. Lett. 40(6), 568–572 (2012)

Mattia, S.: Solving survivable two-layer network design problems by metric inequalities. Comput. Optim. Appl. 51(2), 809–834 (2012)

Mattia, S.: A polyhedral study of the capacity formulation of the multilayer network design problem. Networks 62(1), 17–26 (2013)

Mattia, S.: The robust network loading problem with dynamic routing. Comput. Optim. Appl. 54(3), 619–643 (2013)

Mattia, S.: The cut property under demand uncertainty. Networks 66(2), 159–168 (2015)

Mattia, S., Rossi, F., Servilio, M., Smriglio, S.: Staffing and scheduling flexible call centers by two-stage robust optimization. Omega 72, 25–37 (2017)

Minoux, M.: Robust network optimization under polyhedral demand uncertainty is NP-hard. Discrete Appl. Math. 158(5), 597–603 (2010)

Mudchanatongsuk, S., Ordonez, F., Liu, J.: Robust solutions for network design under transportation cost and demand uncertainty. J. Oper. Res. Soc. 59, 552–562 (2008)

Ordóñez, F., Zhao, J.: Robust capacity expansion of network flows. Networks 50(2), 136–145 (2007)

Orlowski, S., Pióro, M., Tomaszewski, A., Wessäly, R.: SNDlib 1.0-Survivable Network Design Library. Networks 55(3), 276–286 (2010)

Ouorou, A.: Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty. Comput. Oper. Res. 40(1), 318–327 (2013)

Ouorou, A., Vial, J.-P.: A model for robust capacity planning for telecommunications networks under demand uncertainty. In: Proceedings of DRCN 2007, pp. 1–4 (2007)

Pioro, M., Nace, D., Poss, M., Fouquet, Y.: Optimizing flow thinning protection in multicommodity networks with variable link capacity. Oper. Res. 64(2), 273–289 (2016)

Poss, M.: A comparison of routing sets for robust network design. Optim. Lett. 8(5), 1619–1635 (2014)

Poss, M., Raack, C.: Affine recourse for the robust network design problem: between static and dynamic routing. Networks 61(2), 180–198 (2013)

Scutellà, M.: On improving optimal oblivious routing. Oper. Res. Lett. 37(3), 197–200 (2009)

Wiesemann, W., Kuhn, D., Sim, M.: Distributionally robust convex optimization. Oper. Res. 62(6), 1358–1376 (2014)

Zeng, B., Zhao, L.: Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5), 457–461 (2013)

Zhang, Y., Roughan, M., Duffield, N., Greenberg, A.: Fast accurate computation of large-scale IP traffic matrices from link loads. In: Proceedings of ACM SIGMETRICS, pp. 206–217 (2003)