{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T07:23:16Z","timestamp":1770448996656,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,11,7]],"date-time":"2017-11-07T00:00:00Z","timestamp":1510012800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10589-017-9956-z","type":"journal-article","created":{"date-parts":[[2017,11,7]],"date-time":"2017-11-07T03:00:57Z","timestamp":1510023657000},"page":"753-800","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation"],"prefix":"10.1007","volume":"69","author":[{"given":"Sara","family":"Mattia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9145-2525","authenticated-orcid":false,"given":"Michael","family":"Poss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,7]]},"reference":[{"issue":"1","key":"9956_CR1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1287\/opre.1120.1147","volume":"61","author":"Y Agarwal","year":"2015","unstructured":"Agarwal, Y.: Design of survivable networks using three- and four-partition facets. Oper. Res. 61(1), 199\u2013213 (2015)","journal-title":"Oper. Res."},{"issue":"3","key":"9956_CR2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/net.20098","volume":"47","author":"YK Agarwal","year":"2006","unstructured":"Agarwal, Y.K.: k-partition-based facets of the network design problem. Networks 47(3), 123\u2013139 (2006)","journal-title":"Networks"},{"issue":"1","key":"9956_CR3","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1002\/net.20145","volume":"49","author":"A Alt\u0131n","year":"2007","unstructured":"Alt\u0131n, A., Amaldi, E., Belotti, P., P\u0131nar, M.: Provisioning virtual private networks under traffic uncertainty. Networks 49(1), 100\u2013115 (2007)","journal-title":"Networks"},{"issue":"1","key":"9956_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1287\/ijoc.1100.0380","volume":"23","author":"A Altin","year":"2011","unstructured":"Altin, A., Yaman, H., Pinar, M\u00a0c: The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations. INFORMS J. Comput. 23(1), 75\u201389 (2011)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"9956_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10479-011-1003-3","volume":"199","author":"R Andrade","year":"2012","unstructured":"Andrade, R., Lisser, A., Maculan, N.: Multi-service multi-facility network design under uncertainty. Ann. Oper. Res. 199(1), 157\u2013178 (2012)","journal-title":"Ann. Oper. Res."},{"key":"9956_CR6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.disopt.2006.10.002","volume":"4","author":"P Avella","year":"2007","unstructured":"Avella, P., Mattia, S., Sassano, A.: Metric inequalities and the network loading problem. Discrete Optim. 4, 103\u2013114 (2007)","journal-title":"Discrete Optim."},{"issue":"2","key":"9956_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10287-016-0249-2","volume":"13","author":"J Ayoub","year":"2016","unstructured":"Ayoub, J., Poss, M.: Decomposition for adjustable robust linear optimization subject to uncertainty polytope. Comput. Manag. Sci. 13(2), 219\u2013239 (2016)","journal-title":"Comput. Manag. Sci."},{"issue":"4","key":"9956_CR8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/net.21515","volume":"62","author":"F Babonneau","year":"2013","unstructured":"Babonneau, F., Vial, J.-P., Klopfenstein, O., Ouorou, A.: Robust capacity assignment solutions for telecommunications networks with uncertain demands. Networks 62(4), 255\u2013272 (2013)","journal-title":"Networks"},{"key":"9956_CR9","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1137\/S1052623494279134","volume":"6","author":"F Barahona","year":"1996","unstructured":"Barahona, F.: Network design using cut inequalities. SIAM J. Optim. 6, 823\u2013834 (1996)","journal-title":"SIAM J. Optim."},{"key":"9956_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Ameur, W.: Between fully dynamic routing and robust stable routing. In: Proceedings of DRCN2007, pp. 1\u20136 (2007)","DOI":"10.1109\/DRCN.2007.4762277"},{"key":"9956_CR11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s11081-005-1741-7","volume":"6","author":"W Ben-Ameur","year":"2005","unstructured":"Ben-Ameur, W., Kerivin, H.: Routing of uncertain traffic demands. Optim. Eng. 6, 283\u2013313 (2005)","journal-title":"Optim. Eng."},{"key":"9956_CR12","doi-asserted-by":"crossref","unstructured":"Ben-Ameur, W., Zotkiewicz, M.: Volume oriented routing. In: Proceedings of NETWORKS2010), pp. 1\u20137 (2010)","DOI":"10.1109\/NETWKS.2010.5624920"},{"key":"9956_CR13","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., Ghaoui, L\u00a0.E., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"issue":"2","key":"9956_CR14","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Math. Program. 99(2), 351\u2013376 (2004)","journal-title":"Math. Program."},{"issue":"1","key":"9956_CR15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"9956_CR16","first-page":"177","volume":"81","author":"D Bienstock","year":"1998","unstructured":"Bienstock, D., Chopra, S., G\u00fcnl\u00fck, O., Tsai, C.-Y.: Minimum cost capacity installation for multicommodity network flows. Math. Program. 81, 177\u2013199 (1998)","journal-title":"Math. Program."},{"key":"9956_CR17","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.disopt.2006.10.007","volume":"4","author":"D Bienstock","year":"2007","unstructured":"Bienstock, D., Mattia, S.: Using mixed-integer programming to solve power grid blackout problems. Discrete Optim. 4, 115\u2013141 (2007)","journal-title":"Discrete Optim."},{"key":"9956_CR18","unstructured":"Bley, A., Klaehne, R., Menne, U., Raack, C., Wessaely, R.: Multi-layer network design\u2014a model-based optimization approach. In: Proceedings of the PGTS 2008, Berlin, Germany, pp. 107\u2013116 (2008)"},{"issue":"1","key":"9956_CR19","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10107-016-0991-9","volume":"157","author":"V Cacchiani","year":"2016","unstructured":"Cacchiani, V., J\u00fcnger, M., Liers, F., Lodi, A., Schmidt, D.R.: Single-commodity robust network design with finite and hose demand sets. Math. Program. 157(1), 297\u2013342 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"9956_CR20","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.20165","volume":"50","author":"C Chekuri","year":"2007","unstructured":"Chekuri, C., Oriolo, G., Scutell\u00e0, M., Shepherd, F.: Hardness of robust network design. Networks 50(1), 50\u2013154 (2007)","journal-title":"Networks"},{"key":"9956_CR21","unstructured":"CPLEX: IBM ILOG CPLEX 12.6 Reference Manual. ILOG CPLEX Division, Gentilly, France (2013)"},{"key":"9956_CR22","doi-asserted-by":"crossref","unstructured":"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\u2013108 (1999)","DOI":"10.1145\/316188.316209"},{"issue":"2","key":"9956_CR23","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/jagm.1997.0866","volume":"24","author":"J Fingerhut","year":"1997","unstructured":"Fingerhut, J., Suri, S., Turner, J.: Designing least-cost nonblocking broadband networks. J. Algorithms 24(2), 287\u2013309 (1997)","journal-title":"J. Algorithms"},{"issue":"5","key":"9956_CR24","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.orl.2009.05.007","volume":"37","author":"B Fortz","year":"2009","unstructured":"Fortz, B., Poss, M.: An improved benders decomposition applied to a multi-layer network design problem. Oper. Res. Lett. 37(5), 359\u2013364 (2009)","journal-title":"Oper. Res. Lett."},{"key":"9956_CR25","doi-asserted-by":"crossref","unstructured":"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\u2013398 (2001)","DOI":"10.1145\/380752.380830"},{"issue":"2","key":"9956_CR26","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1002\/net.21497","volume":"61","author":"A Koster","year":"2013","unstructured":"Koster, A., Kutschka, M., Raack, C.: Robust network design: formulations, valid inequalities, and computations. Networks 61(2), 128\u2013149 (2013)","journal-title":"Networks"},{"issue":"1","key":"9956_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.21486","volume":"62","author":"C Lee","year":"2013","unstructured":"Lee, C., Lee, K., Park, S.: Benders decomposition approach for the robust network design problem with flow bifurcations. Networks 62(1), 1\u201316 (2013)","journal-title":"Networks"},{"issue":"3","key":"9956_CR28","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.ejor.2010.03.007","volume":"206","author":"C Lemar\u00e9chal","year":"2010","unstructured":"Lemar\u00e9chal, C., Ouorou, A., Petrou, G.: Robust network design in telecommunications under polytope demand uncertainty. Eur. J. Oper. Res. 206(3), 634\u2013641 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9956_CR29","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"T Magnanti","year":"1993","unstructured":"Magnanti, T., Mirchandani, P., Vachani, R.: The convex hull of two core capacitated network design problems. Math. Program. 60, 233\u2013250 (1993)","journal-title":"Math. Program."},{"issue":"6","key":"9956_CR30","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/j.orl.2012.09.009","volume":"40","author":"S Mattia","year":"2012","unstructured":"Mattia, S.: Separating tight metric inequalities by bilevel programming. Oper. Res. Lett. 40(6), 568\u2013572 (2012)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9956_CR31","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1007\/s10589-010-9364-0","volume":"51","author":"S Mattia","year":"2012","unstructured":"Mattia, S.: Solving survivable two-layer network design problems by metric inequalities. Comput. Optim. Appl. 51(2), 809\u2013834 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9956_CR32","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/net.21488","volume":"62","author":"S Mattia","year":"2013","unstructured":"Mattia, S.: A polyhedral study of the capacity formulation of the multilayer network design problem. Networks 62(1), 17\u201326 (2013)","journal-title":"Networks"},{"issue":"3","key":"9956_CR33","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s10589-012-9500-0","volume":"54","author":"S Mattia","year":"2013","unstructured":"Mattia, S.: The robust network loading problem with dynamic routing. Comput. Optim. Appl. 54(3), 619\u2013643 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"9956_CR34","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.21621","volume":"66","author":"S Mattia","year":"2015","unstructured":"Mattia, S.: The cut property under demand uncertainty. Networks 66(2), 159\u2013168 (2015)","journal-title":"Networks"},{"key":"9956_CR35","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.omega.2016.11.001","volume":"72","author":"S Mattia","year":"2017","unstructured":"Mattia, S., Rossi, F., Servilio, M., Smriglio, S.: Staffing and scheduling flexible call centers by two-stage robust optimization. Omega 72, 25\u201337 (2017)","journal-title":"Omega"},{"issue":"5","key":"9956_CR36","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.dam.2009.09.025","volume":"158","author":"M Minoux","year":"2010","unstructured":"Minoux, M.: Robust network optimization under polyhedral demand uncertainty is NP-hard. Discrete Appl. Math. 158(5), 597\u2013603 (2010)","journal-title":"Discrete Appl. Math."},{"key":"9956_CR37","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1057\/palgrave.jors.2602362","volume":"59","author":"S Mudchanatongsuk","year":"2008","unstructured":"Mudchanatongsuk, S., Ordonez, F., Liu, J.: Robust solutions for network design under transportation cost and demand uncertainty. J. Oper. Res. Soc. 59, 552\u2013562 (2008)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"9956_CR38","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1002\/net.20183","volume":"50","author":"F Ord\u00f3\u00f1ez","year":"2007","unstructured":"Ord\u00f3\u00f1ez, F., Zhao, J.: Robust capacity expansion of network flows. Networks 50(2), 136\u2013145 (2007)","journal-title":"Networks"},{"issue":"3","key":"9956_CR39","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","volume":"55","author":"S Orlowski","year":"2010","unstructured":"Orlowski, S., Pi\u00f3ro, M., Tomaszewski, A., Wess\u00e4ly, R.: SNDlib 1.0-Survivable Network Design Library. Networks 55(3), 276\u2013286 (2010)","journal-title":"Networks"},{"issue":"1","key":"9956_CR40","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.cor.2012.07.001","volume":"40","author":"A Ouorou","year":"2013","unstructured":"Ouorou, A.: Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty. Comput. Oper. Res. 40(1), 318\u2013327 (2013)","journal-title":"Comput. Oper. Res."},{"key":"9956_CR41","doi-asserted-by":"crossref","unstructured":"Ouorou, A., Vial, J.-P.: A model for robust capacity planning for telecommunications networks under demand uncertainty. In: Proceedings of DRCN 2007, pp. 1\u20134 (2007)","DOI":"10.1109\/DRCN.2007.4762287"},{"issue":"2","key":"9956_CR42","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/opre.2016.1486","volume":"64","author":"M Pioro","year":"2016","unstructured":"Pioro, M., Nace, D., Poss, M., Fouquet, Y.: Optimizing flow thinning protection in multicommodity networks with variable link capacity. Oper. Res. 64(2), 273\u2013289 (2016)","journal-title":"Oper. Res."},{"issue":"5","key":"9956_CR43","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1007\/s11590-013-0679-5","volume":"8","author":"M Poss","year":"2014","unstructured":"Poss, M.: A comparison of routing sets for robust network design. Optim. Lett. 8(5), 1619\u20131635 (2014)","journal-title":"Optim. Lett."},{"issue":"2","key":"9956_CR44","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1002\/net.21482","volume":"61","author":"M Poss","year":"2013","unstructured":"Poss, M., Raack, C.: Affine recourse for the robust network design problem: between static and dynamic routing. Networks 61(2), 180\u2013198 (2013)","journal-title":"Networks"},{"issue":"3","key":"9956_CR45","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.orl.2009.01.009","volume":"37","author":"M Scutell\u00e0","year":"2009","unstructured":"Scutell\u00e0, M.: On improving optimal oblivious routing. Oper. Res. Lett. 37(3), 197\u2013200 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"9956_CR46","doi-asserted-by":"crossref","first-page":"1358","DOI":"10.1287\/opre.2014.1314","volume":"62","author":"W Wiesemann","year":"2014","unstructured":"Wiesemann, W., Kuhn, D., Sim, M.: Distributionally robust convex optimization. Oper. Res. 62(6), 1358\u20131376 (2014)","journal-title":"Oper. Res."},{"issue":"5","key":"9956_CR47","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","volume":"41","author":"B Zeng","year":"2013","unstructured":"Zeng, B., Zhao, L.: Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5), 457\u2013461 (2013)","journal-title":"Oper. Res. Lett."},{"key":"9956_CR48","doi-asserted-by":"crossref","unstructured":"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\u2013217 (2003)","DOI":"10.1145\/885651.781053"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9956-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9956-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9956-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T10:47:15Z","timestamp":1719571635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9956-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,7]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["9956"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9956-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,7]]}}}