{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:06:25Z","timestamp":1757311585437},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215261"},{"type":"electronic","value":"9783642215278"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21527-8_22","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T11:01:16Z","timestamp":1315479676000},"page":"170-175","source":"Crossref","is-referenced-by-count":7,"title":["Multilayer Survivable Optical Network Design"],"prefix":"10.1007","author":[{"given":"Sylvie","family":"Borne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Virginie","family":"Gabrel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ridha","family":"Mahjoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raouia","family":"Taktak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","first-page":"241","volume":"68","author":"E. Balas","year":"1995","unstructured":"Balas, E., Fischetti, M., Pulleyblank, W.R.: The precedence-constrained asymmetric traveling salesman polytope. Mathematical Programming\u00a068(1), 241\u2013265 (1995)","journal-title":"Mathematical Programming"},{"doi-asserted-by":"crossref","unstructured":"Borne, S., Gourdin, E., Liau, B., Mahjoub, A.R.: Design of survivable IP-over-optical networks. Annals of Operations Research\u00a0(146), 41\u201373 (2006)","key":"22_CR2","DOI":"10.1007\/s10479-006-0047-2"},{"issue":"5","key":"22_CR3","doi-asserted-by":"publisher","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. Operations Research\u00a047(5), 693\u2013702 (1999)","journal-title":"Operations Research"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1051\/ro\/1984180302031","volume":"18","author":"G. Laporte","year":"1984","unstructured":"Laporte, G., Mercure, H., Nobert, Y.: Optimal tour planning with specified nodes. RAIRO, rech. Oplle\/ Opns. Res.\u00a018, 203\u2013210 (1984)","journal-title":"RAIRO, rech. Oplle\/ Opns. Res."},{"key":"22_CR5","first-page":"95","volume-title":"Graphs and Algorithms in Communication Networks","author":"S. Orlowski","year":"2010","unstructured":"Orlowski, S., Raack, C., Koster, A.M.C.A., Baier, G., Engel, T., Belotti, P.: Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems. In: Graphs and Algorithms in Communication Networks, pp. 95\u2013118. Springer, Heidelberg (2010)"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0377-2217(02)00359-4","volume":"147","author":"J.J. Salazar-Gonz\u00e1lez","year":"2003","unstructured":"Salazar-Gonz\u00e1lez, J.J.: The steiner cycle polytope. European Journal of Operational Research\u00a0147, 671\u2013679 (2003)","journal-title":"European Journal of Operational Research"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0166-218X(97)00121-2","volume":"85","author":"T. Eilam-Tzoreff","year":"1998","unstructured":"Eilam-Tzoreff, T.: The disjoint shortest paths problem. Discrete Applied Mathematics\u00a085, 113\u2013138 (1998)","journal-title":"Discrete Applied Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Zhang, P., Zhao, W.: On the complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems. In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Book Chapter), pp. 70\u201381 (2007)","key":"22_CR8","DOI":"10.1007\/978-3-540-74450-4_7"}],"container-title":["Lecture Notes in Computer Science","Network Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21527-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T04:27:24Z","timestamp":1560572844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}