{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:37:41Z","timestamp":1765960661657},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T00:00:00Z","timestamp":1287792000000},"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":[[2012,3]]},"DOI":"10.1007\/s10589-010-9364-0","type":"journal-article","created":{"date-parts":[[2010,10,22]],"date-time":"2010-10-22T15:31:47Z","timestamp":1287761507000},"page":"809-834","source":"Crossref","is-referenced-by-count":22,"title":["Solving survivable two-layer network design problems by metric inequalities"],"prefix":"10.1007","volume":"51","author":[{"given":"Sara","family":"Mattia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,23]]},"reference":[{"key":"9364_CR1","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. 92, 425\u2013437 (2002)","journal-title":"Math. Program."},{"key":"9364_CR2","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":"5","key":"9364_CR3","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1109\/90.879346","volume":"8","author":"D. Banerjee","year":"2000","unstructured":"Banerjee, D., Mukherjee, B.: Wavelength-routed optical networks: linear formulatation, resource budgeting tradeoffs, and a reconfiguration study. IEEE Trans. Netw. 8(5), 598\u2013607 (2000)","journal-title":"IEEE Trans. Netw."},{"key":"9364_CR4","first-page":"422","volume-title":"Proceedings of the 2nd International Network Optimization Conference (INOC 2005)","author":"P. Belotti","year":"2005","unstructured":"Belotti, P., Malucelli, F.: Multilayer network design: a row-column generation algorithm. In: Proceedings of the 2nd International Network Optimization Conference (INOC 2005), vol. 3, pp. 422\u2013427. Lisbon, Portugal, March (2005)"},{"key":"9364_CR5","volume-title":"Proceedings of the 3rd International Network Optimization Conference (INOC 2007)","author":"P. Belotti","year":"2007","unstructured":"Belotti, P., Capone, A., Carello, G., Malucelli, F., Senaldi, F., Totaro, A.: Design of multi-layer networks with traffic grooming and statistical multiplexing. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium, April (2007)"},{"issue":"5","key":"9364_CR6","first-page":"777","volume":"37","author":"B. Bernard","year":"2009","unstructured":"Bernard, B., Poss, M.: An improved benders decomposition applied to a multi-layer network design problem. Oper. Res. Lett. 37(5), 777\u2013795 (2009)","journal-title":"Oper. Res. Lett."},{"key":"9364_CR7","first-page":"177","volume":"81","author":"D. Bienstock","year":"1998","unstructured":"Bienstock, D., Chopra, S., G\u00fcnl\u00fck, O., Tsai, C.Y.: Mininum cost capacity installation for multicommodity flows. Math. Program. 81, 177\u2013199 (1998)","journal-title":"Math. Program."},{"key":"9364_CR8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10479-006-0047-2","volume":"146","author":"S. Borne","year":"2006","unstructured":"Borne, S., Gourdin, E., Liau, B., Mahjoub, A.: Design of survivable IP-over-optical networks. Ann. Oper. Res. 146, 41\u201373 (2006)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"9364_CR9","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10589-007-9122-0","volume":"42","author":"A.M. Costa","year":"2009","unstructured":"Costa, A.M., Cordeau, J.F., Gendron, B.: Metric inequalities, cutset inequalities and benders feasibility cuts for multicommodity capacitated network design. Comput. Optim. Appl. 42(3), 371\u2013392 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"9364_CR10","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1287\/opre.47.5.693","volume":"47","author":"G. Dahl","year":"1999","unstructured":"Dahl, G., Martin, A., Stoer, M.: Routing through virtual paths in layered telecommunication networks. Oper. Res. 47(5), 693\u2013702 (1999)","journal-title":"Oper. Res."},{"key":"9364_CR11","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":"9364_CR12","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1006\/eujc.1999.0383","volume":"21","author":"M. Deza","year":"2000","unstructured":"Deza, M., Pantaleeva, E.: Quasi-semi-metrics, oriented multi-cuts and related polyhedra. Eur. J. Comb. 21, 777\u2013795 (2000)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"9364_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s11067-007-9038-3","volume":"8","author":"L. Gouveia","year":"2008","unstructured":"Gouveia, L., Patricio, P., de Sousa, A.: Hop-constrained node survivable network design: An application to MPLS over WDM. Netw. Spatial Econ. 8(1), 3\u201321 (2008)","journal-title":"Netw. Spatial Econ."},{"key":"9364_CR14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s101070050077","volume":"86","author":"O. G\u00fcnl\u00fck","year":"1999","unstructured":"G\u00fcnl\u00fck, O.: A branch-and-cut algorithm for capacitated network design problems. Math. Program. 86, 17\u201339 (1999)","journal-title":"Math. Program."},{"key":"9364_CR15","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."},{"issue":"1","key":"9364_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H. Kerivin","year":"2005","unstructured":"Kerivin, H., Mahjoub, A.: Design of survivable networks: a survey. Networks 46(1), 1\u201321 (2005)","journal-title":"Networks"},{"key":"9364_CR17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ejor.2006.07.046","volume":"183","author":"A. Knippel","year":"2007","unstructured":"Knippel, A., Lardeaux, B.: The multi-layered network design problem. Eur. J. Oper. Res. 183, 87\u201399 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9364_CR18","first-page":"335","volume-title":"Proceedings of ONDM 2005","author":"A.M.C.A. Koster","year":"2005","unstructured":"Koster, A.M.C.A., Zymolka, A.: Provably good solutions for wavelength assignment in optical networks. In: Proceedings of ONDM 2005, pp. 335\u2013345. The 9th IFIP Working Conference on Optical Network Design & Modelling, Milan, Italy (2005)"},{"issue":"1","key":"9364_CR19","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1111\/j.1467-9574.2007.00351.x","volume":"61","author":"A.M.C.A. Koster","year":"2007","unstructured":"Koster, A.M.C.A., Zymolka, A.: Tight LP-based lower bounds for wavelength conversion in optical networks. Stat. Neerlandica 61(1), 115\u2013136 (2007)","journal-title":"Stat. Neerlandica"},{"key":"9364_CR20","first-page":"1","volume-title":"Selected Proceedings 9th INFORMS Telecommunications Conference","author":"A. Koster","year":"2008","unstructured":"Koster, A., Orlowski, S., Raack, C., Baier, G., Engel, T.: Single-layer cuts for multi-layer network design problems. In: Selected Proceedings 9th INFORMS Telecommunications Conference, vol. 1, pp. 1\u201323. Springer, Berlin (2008)"},{"key":"9364_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(85)90004-6","volume":"11","author":"M. Lomonosov","year":"1985","unstructured":"Lomonosov, M.: Combinatorial approaches to multiflow problems. Discrete Appl. Math. 11, 1\u201393 (1985)","journal-title":"Discrete Appl. Math."},{"key":"9364_CR22","unstructured":"Mattia, S.: The Network Loading Problem. PhD thesis, Universit\u00e0 degli Studi di Roma \u201cLa Sapienza\u201d (2004)"},{"issue":"4","key":"9364_CR23","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. Circ. Theory 18(4), 425\u2013429 (1971)","journal-title":"IEEE Trans. Circ. Theory"},{"key":"9364_CR24","unstructured":"Orlowski, S.: Optimal design of survivable multi-layer telecommunication networks. PhD thesis, TU Berlin (2009). http:\/\/opus.kobv.de\/tuberlin\/volltexte\/2009\/2275\/"},{"key":"9364_CR25","volume-title":"Proceedings of the INOC 2007","author":"S. Orlowski","year":"2007","unstructured":"Orlowski, S., Koster, A., Raack, C., Wess\u00e4ly, R.: Two-layer network design by branch-and-cut featuring MIP-based heuristics. In: Proceedings of the INOC 2007, Spa, Belgium (2007)"},{"key":"9364_CR26","volume-title":"Proceedings of the 3rd International Network Optimization Conference (INOC 2007)","author":"S. Orlowski","year":"2007","unstructured":"Orlowski, S., Pi\u00f3ro, M., Tomaszewski, A., Wess\u00e4ly, R.: SNDlib 1.0\u2013survivable network design library. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium, April (2007). http:\/\/sndlib.zib.de"},{"key":"9364_CR27","unstructured":"Orlowski, S., Wess\u00e4ly, R.: An integer programming model for multi-layer network design. ZIB Preprint ZR-04-49, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, December (2004). http:\/\/www.zib.de\/PaperWeb\/abstracts\/ZR-04-49"},{"issue":"1","key":"9364_CR28","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. Padberg","year":"1991","unstructured":"Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large scale symmetric traveling salesman problems. SIAM Rev. 33(1), 60\u2013100 (1991)","journal-title":"SIAM Rev."},{"key":"9364_CR29","unstructured":"Rajan, D.: Designing capacitated survivable networks: polyhedral analysis and algorithms. PhD thesis, UC Berkeley (2004)"},{"key":"9364_CR30","doi-asserted-by":"crossref","unstructured":"Stoer, M., Dahl, G.: A polyhedral approach to multicommodity survivable network design. Numer. Math. 68(1) (1994)","DOI":"10.1007\/s002110050054"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-010-9364-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-010-9364-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-010-9364-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T19:25:35Z","timestamp":1559762735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-010-9364-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,23]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["9364"],"URL":"https:\/\/doi.org\/10.1007\/s10589-010-9364-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,23]]}}}