{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T07:40:27Z","timestamp":1743666027401,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642321467"},{"type":"electronic","value":"9783642321474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32147-4_24","type":"book-chapter","created":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T11:54:50Z","timestamp":1341489290000},"page":"261-272","source":"Crossref","is-referenced-by-count":5,"title":["Models and Algorithms for Robust Network Design with Several Traffic Scenarios"],"prefix":"10.1007","author":[{"given":"Eduardo","family":"\u00c1lvarez-Miranda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentina","family":"Cacchiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Dorneth","sequence":"additional","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"}]},{"given":"Tiziano","family":"Parriani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel R.","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1002\/net.20145","volume":"49","author":"A. Altin","year":"2007","unstructured":"Altin, A., Amaldi, E., Belotti, P., Pinar, M.C.: Provisioning virtual private networks under traffic uncertainty. Networks\u00a049(1), 100\u2013115 (2007)","journal-title":"Networks"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","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 Optimization\u00a04(1), 103\u2013114 (2007)","journal-title":"Discrete Optimization"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s11081-005-1741-7","volume":"3","author":"W. Ben-Ameur","year":"2005","unstructured":"Ben-Ameur, W., Kerivin, H.: Routing of uncertain demands. Optimization and Engineering\u00a03, 283\u2013313 (2005)","journal-title":"Optimization and Engineering"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","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.H.: Minimum cost capacity installation for multicommodity network flows. Math. Program.\u00a081(2), 177\u2013199 (1998)","journal-title":"Math. Program."},{"issue":"4","key":"24_CR5","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.orl.2008.01.004","volume":"36","author":"C. Buchheim","year":"2008","unstructured":"Buchheim, C., Liers, F., Oswald, M.: Local cuts revisited. Operations Research Letters\u00a036(4), 430\u2013433 (2008)","journal-title":"Operations Research Letters"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-21527-8_2","volume-title":"Network Optimization","author":"C. Buchheim","year":"2011","unstructured":"Buchheim, C., Liers, F., Sanit\u00e0, L.: An Exact Algorithm for Robust Network Design. In: Pahl, J., Reiners, T., Vo\u00df, S. (eds.) INOC 2011. LNCS, vol.\u00a06701, pp. 7\u201317. Springer, Heidelberg (2011)"},{"issue":"3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1145\/1324215.1324236","volume":"38","author":"C. Chekuri","year":"2007","unstructured":"Chekuri, C.: Routing and network design with robustness to changing or uncertain traffic demands. SIGACT News\u00a038(3), 106\u2013128 (2007)","journal-title":"SIGACT News"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Duffield, N.G., Goyal, P., Greenberg, A.G., Mishra, P.P., Ramakrishnan, K.K., van der Merwe, J.E.: A flexible model for resource management in virtual private networks. In: Proceedings of SIGCOMM, vol.\u00a029, pp. 95\u2013108 (1999)","DOI":"10.1145\/316194.316209"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., Grandoni, F., Oriolo, G., Skutella, M.: New approaches for virtual private network design. SIAM Journal on Computing, 706\u2013721 (2007)","DOI":"10.1137\/060654827"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Erlebach, T., R\u00fcegg, M.: Optimal bandwidth reservation in hose-model VPNs with multi-path routing. In: Proceedings of INFOCOM, vol.\u00a04, pp. 2275\u20132282 (2004)","DOI":"10.1109\/INFCOM.2004.1354650"},{"issue":"2","key":"24_CR11","doi-asserted-by":"publisher","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.S.: Designing least-cost nonblocking broadband networks. Journal of Algorithms\u00a024(2), 287\u2013309 (1997)","journal-title":"Journal of Algorithms"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Oriolo, G., Sanit\u00e0, L., Theis, D.O.: The VPN problem with concave costs. SIAM Journal on Discrete Mathematics, 1080\u20131090 (2010)","DOI":"10.1137\/090749700"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1995.0805","volume":"22","author":"A.V. Goldberg","year":"1997","unstructured":"Goldberg, A.V.: An efficient implementation of a scaling minimum-cost flow algorithm. Journal of Algorithms\u00a022(1), 1\u201329 (1997)","journal-title":"Journal of Algorithms"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: Proceedings of STOC, pp. 365\u2013372 (2003)","DOI":"10.1145\/780542.780597"},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica\u00a021(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"210","DOI":"10.4153\/CJM-1957-024-0","volume":"9","author":"L.R. Ford Jr.","year":"1957","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: A simple algorithm for finding maximal network flows and an application to the hitchcock problem. Canadian Journal of Mathematics\u00a09, 210\u2013218 (1957)","journal-title":"Canadian Journal of Mathematics"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Kerivin, H., Mahjoub, A.R.: Design of survivable networks: A survey. Networks, 1\u201321 (2005)","DOI":"10.1002\/net.20072"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Koster, A.M.C.A., Kutschka, M., Raack, C.: Towards robust network design using integer linear programming techniques. In: NGI, pp. 1\u20138 (2010)","DOI":"10.1109\/NGI.2010.5534462"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/net.20046","volume":"45","author":"T.L. Magnanti","year":"2005","unstructured":"Magnanti, T.L., Raghavan, S.: Strong formulations for network design problems with connectivity requirements. Networks\u00a045, 61\u201379 (2005)","journal-title":"Networks"},{"issue":"2-3, Ser. B","key":"24_CR20","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-002-0328-8","volume":"94","author":"S.T. McCormick","year":"2003","unstructured":"McCormick, S.T., Rao, M.R., Rinaldi, G.: Easy and difficult objective functions for max-cut. Math. Program.\u00a094(2-3, Ser. B), 459\u2013466 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"24_CR21","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.20395","volume":"57","author":"C. Raack","year":"2011","unstructured":"Raack, C., Koster, A.M.C.A., Orlowski, S., Wess\u00e4ly, R.: On cut-based inequalities for capacitated network design polyhedra. Networks\u00a057(2), 141\u2013156 (2011)","journal-title":"Networks"},{"key":"24_CR22","unstructured":"Sanit\u00e0, L.: Robust Network Design. Ph.D. Thesis. Universit\u00e0 La Sapienza, Roma (2009)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32147-4_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T07:20:09Z","timestamp":1743664809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32147-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321467","9783642321474"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32147-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}