{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T20:32:42Z","timestamp":1773088362669,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10589-012-9500-0","type":"journal-article","created":{"date-parts":[[2012,7,31]],"date-time":"2012-07-31T14:23:43Z","timestamp":1343744623000},"page":"619-643","source":"Crossref","is-referenced-by-count":41,"title":["The robust network loading problem with dynamic routing"],"prefix":"10.1007","volume":"54","author":[{"given":"Sara","family":"Mattia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,1]]},"reference":[{"issue":"3","key":"9500_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/net.20098","volume":"47","author":"Y. Agarwal","year":"2006","unstructured":"Agarwal, Y.: K-partition-based facets of the network design problem. Networks 47(3), 123\u2013139 (2006)","journal-title":"Networks"},{"issue":"1","key":"9500_CR2","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.\u00c7.: Provisioning virtual private networks under traffic uncertainty. Networks 49(1), 100\u2013115 (2007)","journal-title":"Networks"},{"issue":"1","key":"9500_CR3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1287\/ijoc.1100.0380","volume":"23","author":"A. Alt\u0131n","year":"2010","unstructured":"Alt\u0131n, A., Yaman, H., P\u0131nar, M.\u00c7.: The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations. INFORMS J. Comput. 23(1), 75\u201389 (2010)","journal-title":"INFORMS J. Comput."},{"key":"9500_CR4","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1287\/opre.1070.0428","volume":"55","author":"A. Atamturk","year":"2007","unstructured":"Atamturk, A., Zhang, M.: Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55, 662\u2013673 (2007)","journal-title":"Oper. Res."},{"key":"9500_CR5","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."},{"key":"9500_CR6","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":"9500_CR7","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":"9500_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D. Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program., Ser. B 98, 49\u201371 (2003)","journal-title":"Math. Program., Ser. B"},{"key":"9500_CR9","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 flows. Math. Program. 81, 177\u2013199 (1998)","journal-title":"Math. Program."},{"issue":"1","key":"9500_CR10","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.G., Shepherd, F.B.: Hardness of robust network design. Networks 50(1), 50\u2013154 (2007)","journal-title":"Networks"},{"key":"9500_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582573","volume":"64","author":"S. Chopra","year":"1994","unstructured":"Chopra, S., Rao, M.R.: The steiner tree problem I: formulations, compositions and extensions of facets. Math. Program. 64, 209\u2013229 (1994)","journal-title":"Math. Program."},{"key":"9500_CR12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10288-005-0071-0","volume":"3","author":"B. Colson","year":"2005","unstructured":"Colson, B., Marcotte, P., Savard, G.: Bilevel programming: a survey. 4OR 3, 87\u2013107 (2005)","journal-title":"4OR"},{"key":"9500_CR13","unstructured":"CPLEX. http:\/\/www.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"key":"9500_CR14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1080\/0233193031000149894","volume":"52","author":"S. Dempe","year":"2003","unstructured":"Dempe, S.: Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization 52, 333\u2013359 (2003)","journal-title":"Optimization"},{"key":"9500_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics","author":"M. Deza","year":"1997","unstructured":"Deza, M., Laurent, M.: Geometry of Cuts and Metrics. Springer, Berlin (1997)"},{"key":"9500_CR16","first-page":"95","volume-title":"Proc. of the ACM SIGCOMM Computer Communication Review","author":"N.G. Duffield","year":"1999","unstructured":"Duffield, N.G., Goyal, P., Greenberg, A., Mishra, P., Ramakrishnan, K.K., van der Merwe, J.E.: A\u00a0flexible model for resource management in virtual private networks. In: Proc. of the ACM SIGCOMM Computer Communication Review, vol. 29, pp. 95\u2013109 (1999)"},{"key":"9500_CR17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/jagm.1997.0866","volume":"24","author":"J.A. Fingerhut","year":"1997","unstructured":"Fingerhut, J.A., Suri, S., Turner, J.: Designing least-cost nonblocking broadband networks. J. Algorithms 24, 287\u2013309 (1997)","journal-title":"J. Algorithms"},{"key":"9500_CR18","volume-title":"17th Annual European Symposium on Algorithms (ESA 2009)","author":"N. Goyal","year":"2009","unstructured":"Goyal, N., Olver, N., Shepherd, B.: Dynamic vs oblivious routing in network design. In: 17th Annual European Symposium on Algorithms (ESA 2009) (2009)"},{"key":"9500_CR19","first-page":"389","volume-title":"Proc. of ACMSTOC 2001","author":"A. Gupta","year":"2001","unstructured":"Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flows. In: Proc. of ACMSTOC 2001, pp. 389\u2013398 (2001)"},{"key":"9500_CR20","first-page":"129","volume":"13","author":"M. Iri","year":"1971","unstructured":"Iri, M.: On an extension of the max-flow min-cut theorem to multicommodity flows. J. Oper. Res. Soc. Jpn. 13, 129\u2013135 (1971)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"9500_CR21","unstructured":"Koster, A., Kutschka, M., Raack, C.: Robust network design: formulations, valid inequalities, and computations. Technical report 11-34, ZIB (2011)"},{"key":"9500_CR22","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"T.L. Magnanti","year":"1993","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: The convex hull of two core capacitated network design problems. Math. Program. 60, 233\u2013250 (1993)","journal-title":"Math. Program."},{"key":"9500_CR23","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: Modeling and solving the two-facility capacitated network loading problem. Oper. Res. 43, 142\u2013157 (1995)","journal-title":"Oper. Res."},{"key":"9500_CR24","unstructured":"Mattia, S.: Separating tight metric inequalities by bilevel programming. Technical report 16-11, IASI-CNR (2011)"},{"issue":"2","key":"9500_CR25","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":"5","key":"9500_CR26","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."},{"issue":"4","key":"9500_CR27","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TCT.1971.1083312","volume":"18","author":"K. Onaga","year":"1971","unstructured":"Onaga, K., Kakusho, O.: On feasibility conditions of multicommodity flows in network. IEEE Trans. Circuit Theory 18(4), 425\u2013429 (1971)","journal-title":"IEEE Trans. Circuit Theory"},{"key":"9500_CR28","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1287\/moor.1070.0280","volume":"33","author":"G. Oriolo","year":"2008","unstructured":"Oriolo, G.: Domination between traffic matrices. Math. Oper. Res. 33, 91\u201396 (2008)","journal-title":"Math. Oper. Res."},{"key":"9500_CR29","volume-title":"Proc. of INOC 2007","author":"S. Orlowski","year":"2007","unstructured":"Orlowski, S., Pi\u00f3ro, M., Tomaszewski, A., Wess\u00e4ly, R.: SNDlib 1.0\u2014Survivable Network Design Library. In: Proc. of INOC 2007 (2007)"},{"key":"9500_CR30","doi-asserted-by":"crossref","unstructured":"Poss, M., Raack, C.: Affine recourse for the robust network design problem: between static and dynamic routing. Technical report 11-03, ZIB (2011)","DOI":"10.1007\/978-3-642-21527-8_19"},{"issue":"2","key":"9500_CR31","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.20395","volume":"57","author":"C. Raack","year":"2011","unstructured":"Raack, C., Koster, A., Orlowski, S., Wess\u00e4ly, R.: On cut-based inequalities for capacitated network design polyhedra. Networks 57(2), 141\u2013156 (2011)","journal-title":"Networks"},{"key":"9500_CR32","unstructured":"Sanit\u00e0, L.: Robust network design. PhD thesis, Sapienza, Universit\u00e0 di Roma (2008)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9500-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-012-9500-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9500-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,12]],"date-time":"2020-07-12T04:21:34Z","timestamp":1594527694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-012-9500-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,1]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9500"],"URL":"https:\/\/doi.org\/10.1007\/s10589-012-9500-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,1]]}}}