{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:08:52Z","timestamp":1761620932614},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,6,27]],"date-time":"2006-06-27T00:00:00Z","timestamp":1151366400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10479-006-0047-2","type":"journal-article","created":{"date-parts":[[2006,6,22]],"date-time":"2006-06-22T20:40:55Z","timestamp":1151008855000},"page":"41-73","source":"Crossref","is-referenced-by-count":24,"title":["Design of survivable IP-over-optical networks"],"prefix":"10.1007","volume":"146","author":[{"given":"Sylvie","family":"Borne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Gourdin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Liau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. Ridha","family":"Mahjoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,27]]},"reference":[{"key":"47_CR1","unstructured":"Abacus. http:\/\/www.oreas.de ."},{"key":"47_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0167-6377(92)90045-5","volume":"12","author":"F. Barahona","year":"1992","unstructured":"Barahona, F. (1992). \u201cSeparating from the Dominant of the Spanning Tree Polytope.\u201d Operations Research Letters, 12, 201\u2013203.","journal-title":"Operations Research Letters"},{"key":"47_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0012-365X(94)00255-H","volume":"147","author":"F. Barahona","year":"1995","unstructured":"Barahona, F. and A.R. Mahjoub. (1995). \u201cOn Two-Connected Subgraph Polytopes.\u201d Discrete Mathematics, 147, 19\u201334.","journal-title":"Discrete Mathematics"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Bradner, S. IETF. (1995). \u201cThe Recommendation for the IP Next Generation Protocol.\u201d (RFC1752).","DOI":"10.17487\/rfc1752"},{"key":"47_CR5","unstructured":"Cplex. http:\/\/www.ilog.com\/products\/cplex\/ ."},{"key":"47_CR6","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/3828.3829","volume":"32","author":"W.H. Cunningham","year":"1985","unstructured":"Cunningham, W.H. (1985). \u201cOptimal Attack and Reinforcement of a Network.\u201d Journal of Association for Computing Machinery, 32, 549\u2013561.","journal-title":"Journal of Association for Computing Machinery"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Elf, M., C. Gutwenger, M. J\u00fcnger, and G. Rinaldi. (2001). \u201cBranch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.\u201d In M. J\u00fcnger, and D. Naddef (eds.), Computational Combinatorial Optimization, LNCS 2241, pp. 157\u2013222.","DOI":"10.1007\/3-540-45586-8_5"},{"key":"47_CR8","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V. and R.E. Tarjan. (1988). \u201cA New Approach to the Maximum-flow Problem.\u201d Journal of the Association for Computing Machinery, 35, 921\u2013940.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"47_CR9","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E. and T.C. Hu. (1961). \u201cMulti-Terminal Network Flows.\u201d SIAM Journal on Applied Mathematics, 9, 551\u2013570.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Gouveia, L., P. Patr\u00edcio, A. de Sousa, and R. Valadas. (2003). \u201cMPLS Over WDM Network Design with Packet Level QoS Constraints Based on ILP Models.\u201d In Proceedings IEEE INFOCOM 2003, San Francisco.","DOI":"10.1109\/INFCOM.2003.1208708"},{"key":"47_CR11","unstructured":"Gr\u00f6tschel, M., C.L. Monma, and M. Stoer. (1995). \u201cDesign of Survivable Networks.\u201d In M.O. Ball et al. (eds.), Handbooks in OR & MS 7, pp. 617\u2013671."},{"key":"47_CR12","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0219009","volume":"19","author":"D. Gusfield","year":"1990","unstructured":"Gusfield, D. (1990). \u201dVery Simple Methods for All Pairs Network Flow Analysis.\u201d SIAM Journal on Computing, 19, 143\u2013155.","journal-title":"SIAM Journal on Computing"},{"key":"47_CR13","first-page":"20","volume":"97","author":"T. Jensen","year":"2001","unstructured":"Jensen, T. (2001). \u201cInternet Protocol and Transport Protocols.\u201d Telektronikk, 97, 20\u201338.","journal-title":"Telektronikk"},{"key":"47_CR14","unstructured":"Kerivin, H. (2000). \u201cR\u00e9seaux fiables et poly\u00e8dres.\u201d PhD Thesis, University Blaise Pascal, Clermont-Ferrand, France."},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"Kerivin, H., A.R. Mahjoub, and C. Nocq. (2004). \u201c(1, 2)-Survivable Networks: Facets and Branch-and-Cut.\u201d In M. Gr\u00f6tschel (ed.), The Sharpest Cut, MPS\/SIAM in Optimization, pp. 121\u2013152.","DOI":"10.1137\/1.9780898718805.ch9"},{"key":"47_CR16","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"T.L. Magnanti","year":"1993","unstructured":"Magnanti, T.L., P. Mirchandani, and R. Vachani, (1993). \u201cThe Convex Hull of Two Core Capacitated Network Design Problems.\u201d Mathematical Programming, 60, 233\u2013250.","journal-title":"Mathematical Programming"},{"key":"47_CR17","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., P. Mirchandani, and R. Vachani. (1995). \u201cModeling and Solving the Two-Facility Capacitated Network Loading Problem.\u201d Operations Research, 43, 142\u2013157.","journal-title":"Operations Research"},{"key":"47_CR18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01582572","volume":"64","author":"A.R. Mahjoub","year":"1994","unstructured":"Mahjoub, A.R. (1994). \u201cTwo-Edge Connected Spanning Subgraphs and Polyhedra.\u201d Mathematical Programming, 64, 199\u2013208.","journal-title":"Mathematical Programming"},{"key":"47_CR19","doi-asserted-by":"crossref","unstructured":"Postel, J. IETF. (1981). \u201cInternet Protocol. DARPA Internet Program Protocol Specification.\u201d (RFC791).","DOI":"10.17487\/rfc0791"},{"key":"47_CR20","unstructured":"Postel, J. IETF. (1981).\u201cInternet Control Message Protocol. DARPA Internet Program Protocol Specification.\u201d (RFC792)."},{"key":"47_CR21","doi-asserted-by":"crossref","unstructured":"Postel, J. IETF. (1981). \u201cTransmission Control Protocol. DARPA Internet Program Protocol Specification.\u201d (RFC793).","DOI":"10.17487\/rfc0793"},{"key":"47_CR22","doi-asserted-by":"crossref","unstructured":"Rajagopalan, B., D. Pendarakis, D. Saha, R.S. Ramamoorthy, and K. Bala. (2000). \u201cIP Over Optical Networks: Architectural Aspects.\u201d IEEE Communications Magazine, 94\u2013102.","DOI":"10.1109\/35.868148"},{"key":"47_CR23","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G. (1991). \u201dTSPLIB\u2014A Traveling Salesman Problem Library.\u201d ORSA Journal on Computing, 3, 376\u2013384.","journal-title":"ORSA Journal on Computing"},{"key":"47_CR24","doi-asserted-by":"crossref","unstructured":"Ricciato, F., S. Salsano, A. Belmonte, and M. Listanti. (2002). \u201dOff-line Configuration of a MPLS over WDM Network under Time-Varying Offered Traffic.\u201d In Proceedings IEEE INFOCOM 2002, New York, USA.","DOI":"10.1109\/INFCOM.2002.1019246"},{"key":"47_CR25","unstructured":"Schrijver, A. (2003). \u201cCombinatorial Optimization: Polyhedra and Efficiency.\u201d Algorithms and Combinatorics, 24, Springer-Verlag, Berlin."},{"key":"47_CR26","doi-asserted-by":"crossref","unstructured":"Stoer, M. (1992). \u201cDesign of Survivable Networks.\u201d Lectures Notes in Mathematics 1531, Springer-Verlag.","DOI":"10.1007\/BFb0088963"},{"key":"47_CR27","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s002110050054","volume":"68","author":"M. Stoer","year":"1994","unstructured":"Stoer, M. and G. Dahl. (1994). \u201cA Polyhedral Approach to Multicommodity Survivable Network Design.\u201d Numerische Mathematik, 68, 149\u2013167.","journal-title":"Numerische Mathematik"},{"key":"47_CR28","unstructured":"Thienel, S. (1995). \u201cABACUS\u2014A Branch-And-CUt System.\u201d PhD thesis, Universit\u00e4t zu K\u00f6ln."},{"key":"47_CR29","unstructured":"Wess\u00e4ly, R. (2000). \u201cDImensioning Survivable Capacitated NETworks(DISCNET).\u201d PhD Thesis, Technische Universit\u00e4t Berlin."},{"key":"47_CR30","unstructured":"Zouganeli, E. (2001). \u201cOptical Network Functionality: From \u201cDumb Fat Pipes\u201d to Bright Networking.\u201d Telektronikk, 97, 346\u2013354."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0047-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-006-0047-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0047-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:32Z","timestamp":1559153252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-006-0047-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,27]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["47"],"URL":"https:\/\/doi.org\/10.1007\/s10479-006-0047-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,27]]}}}