{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T12:47:40Z","timestamp":1770814060788,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,3,25]],"date-time":"2016-03-25T00:00:00Z","timestamp":1458864000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10107-016-0991-9","type":"journal-article","created":{"date-parts":[[2016,3,25]],"date-time":"2016-03-25T09:44:09Z","timestamp":1458899049000},"page":"297-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Single-commodity robust network design with finite and Hose demand sets"],"prefix":"10.1007","volume":"157","author":[{"given":"Valentina","family":"Cacchiani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frauke","family":"Liers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7381-912X","authenticated-orcid":false,"given":"Daniel R.","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"issue":"3","key":"991_CR1","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":"991_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"},{"key":"991_CR3","doi-asserted-by":"crossref","unstructured":"\u00c1lvarez-Miranda, E., Cacchiani, V., Dorneth, T., J\u00fcnger, M., Liers, F., Lodi, A., Parriani, T., Schmidt, D.R.: Models and algorithms for robust network design with several traffic scenarios. In: Mahjoub, A., Ridha, Markakis, V., Milis, I., Paschos, V.T. (eds.), ISCO 2012, Revised Selected Papers volume 7422 of LNCS, pp. 261\u2013272. Springer (2012)","DOI":"10.1007\/978-3-642-32147-4_24"},{"issue":"238","key":"991_CR4","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/j.ejor.2014.04.023","volume":"3","author":"E \u00c1lvarez-Miranda","year":"2014","unstructured":"\u00c1lvarez-Miranda, E., Cacchiani, V., Lodi, A., Parriani, T., Schmidt, D.R.: Single-commodity robust network design problem: Complexity, instances and heuristic solutions. Eur. J. Oper. Res. 3(238), 711\u2013723 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"991_CR5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/ijoc.1050.0162","volume":"19","author":"G Andreello","year":"2007","unstructured":"Andreello, G., Caprara, A., Fischetti, M.: Embedding {0, 1\/2}-cuts in a branch-and-cut framework: a computational study. INFORMS J. Comput. 19, 229\u2013238 (2007)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"991_CR6","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s101070100284","volume":"92","author":"A Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk, A.: On capacitated network design cut-set polyhedra. Math. Program. B 92(3), 425\u2013437 (2002)","journal-title":"Math. Program. B"},{"key":"991_CR7","doi-asserted-by":"crossref","unstructured":"Avella, P., Mattia, S., Sassano, A.: Metric inequalities and the network loading problem. In: Bienstock, D., Nemhauser, G. (eds.) Proceedings of the IPCO, volume 3064 of LNCS. pp. 401\u2013421. Springer (2004)","DOI":"10.1007\/978-3-540-25960-2_2"},{"issue":"5439","key":"991_CR8","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"3","key":"991_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(3), 823\u2013837 (1996)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"991_CR10","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(3), 283\u2013313 (2005)","journal-title":"Optim. Eng."},{"issue":"1","key":"991_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1\u201313 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"991_CR12","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238\u2013252 (1962)","journal-title":"Numer. Math."},{"key":"991_CR13","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. B 98, 49\u201371 (2003)","journal-title":"Math. Program. B"},{"issue":"2","key":"991_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01581104","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(2), 177\u2013199 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"991_CR15","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","volume":"8","author":"D Bienstock","year":"1996","unstructured":"Bienstock, D., G\u00fcnl\u00fck, O.: Capacitated network design-polyhedral structure and computation. INFORMS J. Comput. 8(3), 243\u2013259 (1996)","journal-title":"INFORMS J. Comput."},{"key":"991_CR16","doi-asserted-by":"crossref","unstructured":"Buchheim, C., Liers, F., Sanit\u00e0, L.: An exact algorithm for robust network design. In: Pahl, J., Reiners, T., Vo\u00df, S. (eds.) Proceedings of the INOC, INOC\u201911, pp. 7\u201317. Springer (2011)","DOI":"10.1007\/978-3-642-21527-8_2"},{"issue":"3","key":"991_CR17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02592196","volume":"74","author":"A Caprara","year":"1996","unstructured":"Caprara, A., Fischetti, M.: {0, 1\/2}-Chv\u00e1tal-Gomory cuts. Math. Program. 74(3), 221\u2013235 (1996)","journal-title":"Math. Program."},{"issue":"1","key":"991_CR18","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.20165","volume":"50","author":"C Chekuri","year":"2007","unstructured":"Chekuri, C., Shepherd, B.F., Oriolo, G., Scutell\u00e0, M.: Hardness of robust network design. Networks 50(1), 50\u201354 (2007)","journal-title":"Networks"},{"key":"991_CR19","doi-asserted-by":"crossref","unstructured":"Cherkassky, B.V., Goldberg, A.V.: On implementing push-relabel method for the maximum flow problem. In: Balas, E., Clausen, J. (eds.) Proceedings of the IPCO, volume 920 of LNCS, pp. 157\u2013171. Springer (1995)","DOI":"10.1007\/3-540-59408-6_49"},{"key":"991_CR20","unstructured":"Christof, T., L\u00f6bel, A.: PORTA\u2014POlyhedron Representation Transformation Algorithm. http:\/\/typo.zib.de\/opt-long_projects\/Software\/Porta\/ (2008)"},{"key":"991_CR21","unstructured":"Dorneth, T.: Ein Branch-and-Cut-Verfahren f\u00fcr robustes Netzwerkdesign. Diplomarbeit, Universit\u00e4t zu K\u00f6ln (2012)"},{"key":"991_CR22","doi-asserted-by":"crossref","unstructured":"Duffield, N.G., Goyal, P., Greenberg, A., Mishra, P., Ramakrishnan, K.K., van der Merwe, J.E.: A flexible model for resource management in virtual private networks. In: Proceedings of the SIGCOMM, SIGCOMM \u201999, pp. 95\u2013108. ACM (1999)","DOI":"10.1145\/316188.316209"},{"issue":"2","key":"991_CR23","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/jagm.1997.0866","volume":"24","author":"JA Fingerhut","year":"1997","unstructured":"Fingerhut, J.A., Suri, S., Turner, J.S.: Designing Least-cost nonblocking broadband networks. J. Algorithms 24(2), 287\u2013309 (1997)","journal-title":"J. Algorithms"},{"key":"991_CR24","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"issue":"2","key":"991_CR25","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.2140\/pjm.1957.7.1073","volume":"7","author":"D Gale","year":"1957","unstructured":"Gale, D.: A theorem on flows in networks. Pac. J. Math. 7(2), 1073\u20131082 (1957)","journal-title":"Pac. J. Math."},{"issue":"4","key":"991_CR26","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"issue":"2","key":"991_CR27","first-page":"260","volume":"10","author":"R Gomory","year":"1962","unstructured":"Gomory, R., Hu, T.: An application of generalized linear programming to network flows. J. SIAM 10(2), 260\u2013283 (1962)","journal-title":"J. SIAM"},{"issue":"2","key":"991_CR28","first-page":"348","volume":"12","author":"RE Gomory","year":"1964","unstructured":"Gomory, R.E., Hu, T.C.: Synthesis of a communication network. J. SIAM 12(2), 348\u2013369 (1964)","journal-title":"J. SIAM"},{"key":"991_CR29","unstructured":"Johnson, D.S., Minkoff, M., Phillips, S.: The Prize collecting steiner tree problem: theory and practice. In: Proceedings of the SODA, SODA \u201900, pp. 760\u2013769. SIAM (2000)"},{"issue":"11","key":"991_CR30","first-page":"1325","volume":"30","author":"M J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, M., Thienel, S.: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Softw.: Pract. Exper. 30(11), 1325\u20131352 (2000)","journal-title":"Softw.: Pract. Exper."},{"key":"991_CR31","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"6","key":"991_CR32","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787\u2013832 (1999)","journal-title":"J. ACM"},{"key":"991_CR33","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: Modeling and Solving the Capacitated Network Loading Problem. Technical Report OR-239-91, MIT (1991)"},{"issue":"1\u20133","key":"991_CR34","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"TL Magnanti","year":"1993","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: The convex hull of two core capacitated network design problems. Math. Program. 60(1\u20133), 233\u2013250 (1993)","journal-title":"Math. Program."},{"issue":"3","key":"991_CR35","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.29.3.464","volume":"29","author":"TL Magnanti","year":"1981","unstructured":"Magnanti, T.L., Wong, R.T.: Accelerating benders decomposition: algorithmic enhancement and model selection criteria. Oper. Res. 29(3), 464\u2013484 (1981)","journal-title":"Oper. Res."},{"key":"991_CR36","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, 619\u2013643 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"991_CR37","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-002-0328-8","volume":"94","author":"ST McCormick","year":"2003","unstructured":"McCormick, S.T., Rao, M.R., Rinaldi, G.: Easy and difficult objective functions for max-cut. Math. Program. B 94, 459\u2013466 (2003)","journal-title":"Math. Program. B"},{"key":"991_CR38","doi-asserted-by":"crossref","unstructured":"Minoux, M.: Optimum synthesis of a network with non-simultaneous multicommodity flow requirements. In: Annals of Discrete Mathematics (11) Studies on Graphs and Discrete Programming, volume 59, pp. 269\u2013277. North-Holland (1981)","DOI":"10.1016\/S0304-0208(08)73470-4"},{"issue":"5","key":"991_CR39","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1057\/palgrave.jors.2602362","volume":"59","author":"S Mudchanatongsuk","year":"2008","unstructured":"Mudchanatongsuk, S., Ord\u00f3\u00f1ez, F., Liu, J.: Robust solutions for network design under transportation cost and demand uncertainty. J. Oper. Res. Soc. 59(5), 652\u2013662 (2008)","journal-title":"J. Oper. Res. Soc."},{"key":"991_CR40","doi-asserted-by":"crossref","unstructured":"Orlowski, S., Pi\u00f3ro, M., Tomaszewski, A., Wess\u00e4ly, R.: SNDlib 1.0\u2013Survivable Network Design Library. In: Proceedings of the INOC 2007, 2007. http:\/\/sndlib.zib.de , extended version accepted in Networks (2009)","DOI":"10.1002\/net.20371"},{"issue":"2","key":"991_CR41","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/net.10106","volume":"43","author":"R Pesenti","year":"2004","unstructured":"Pesenti, R., Rinaldi, F., Ukovich, W.: An exact algorithm for the min-cost network containment problem. Networks 43(2), 87\u2013102 (2004)","journal-title":"Networks"},{"key":"991_CR42","unstructured":"Raack, C., Koster, A.M.C.A., Wess\u00e4ly, R.: On the Strength of Cut-Based Inequalities for Capacitated Network Design Polyhedra. Technical Report 07-08, ZIB (2007)"},{"key":"991_CR43","unstructured":"Sanit\u00e0, L.: Robust Network Design. Ph.D. Thesis. Universit\u00e0 La Sapienza, Roma (2009)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-0991-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-0991-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-0991-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T20:09:45Z","timestamp":1567714185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-0991-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,25]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["991"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-0991-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,25]]}}}