{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T15:47:39Z","timestamp":1748015259522},"reference-count":25,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1051\/ro:2004003","type":"journal-article","created":{"date-parts":[[2004,3,31]],"date-time":"2004-03-31T14:04:13Z","timestamp":1080741853000},"page":"235-247","source":"Crossref","is-referenced-by-count":10,"title":["Approximation algorithms for the design of SDH\/SONET networks"],"prefix":"10.1051","volume":"37","author":[{"given":"Nadia","family":"Brauner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Crama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerd","family":"Finke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Lemaire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christelle","family":"Wynants","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2004,3,15]]},"reference":[{"key":"R1","unstructured":"R. Aringhieri and M. Dell'Amico,A Variable-Neighborhood Variable-Objective Tabu Search Algorithm for the SONET Ring Assignment with Capacity Constraints. DISMI, Universit\u00e0 di Modena e Reggio Emilia, 10 (2001)."},{"key":"R2","unstructured":"N. Brauner, Y. Crama, P. Lemaire and C. Wynants,Complexit\u00e9 et approximation pour la conception de r\u00e9seaux SONET\/SDH.Technical Report 61, Les Cahiers du Laboratoire Leibniz-IMAG, (October 2002). http:\/\/www-leibniz.imag.fr\/LesCahiers\/"},{"key":"R3","unstructured":"N. Brauner and P. Lemaire,A Set-Covering Approach for SONET Network Design.Technical Report 62, Les Cahiers du Laboratoire Leibniz-IMAG (October 2002). http:\/\/www-leibniz.imag.fr\/LesCahiers\/"},{"key":"R4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"Chv\u00e1tal","year":"1979","journal-title":"Math. Oper. Res."},{"key":"R5","unstructured":"ETSI. ETSI - Telecom Standards. http:\/\/www.etsi.org"},{"key":"R6","unstructured":"ETSI. Transmission and Multiplexing (TM); Synchronous Digital Hierarchy (SDH); Network protection schemes; Rings and other schemes. Technical specification (November 1997). ref: TS 101 010 v1.1.1."},{"key":"R7","unstructured":"ETSI. Transmission and Multiplexing (TM); Synchronous Digital Hierarchy (SDH); Network protection schemes; Types and characteristics. Technical specification (November 1997). ref: TS 101 009 v1.1.1."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"B. Fortz, P. Soriano and C. Wynants, A Tabu Search Algorithm for Self-Healing Ring Network Design.Eur. J. Oper. Res.151(2003).","DOI":"10.1016\/S0377-2217(02)00826-3"},{"key":"R9","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability (A Guide to the Theory of NP-Completeness). W.H. Freeman And Company (1979)."},{"key":"R10","unstructured":"F. Glover and M. Laguna,Modern Heuristic Techniques for Combinatorial Problems,Chapter 3: Tabu Search. C.R. Reeves, Blackwell Scientific Publications edition (1993)."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna,Tabu Search. Kluwer Academic Publishers, London (1997).","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"R12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1002\/net.10054","volume":"41","author":"Goldschmidt","year":"2003","journal-title":"Networks"},{"key":"R13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0166-218X(02)00236-6","volume":"129","author":"Goldschmidt","year":"2003","journal-title":"Discrete Appl. Math."},{"key":"R14","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/0210054","volume":"4","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"R15","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"Johnson","year":"1974","journal-title":"SIAM J. Comput."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"S. Khanna, A Polynomial Time Approximation Scheme for the SONET Ring Loading Problem.Bell Labs Technical Journal(1997) 36-41.","DOI":"10.1002\/bltj.2047"},{"key":"R17","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.40.11.1533","volume":"40","author":"Laguna","year":"1994","journal-title":"Manage. Sci."},{"key":"R18","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/(SICI)1097-0037(200005)35:3<223::AID-NET6>3.0.CO;2-J","volume":"35","author":"Lee","year":"2000","journal-title":"Networks"},{"key":"R19","unstructured":"P. Lemaire, Optimisation de r\u00e9seaux SONET\/SDH : \u00e9l\u00e9ments th\u00e9oriques et r\u00e9solution pratique (juin 2001). M\u00e9moire de DEA."},{"key":"R20","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1007\/BF01759074","volume":"6","author":"Masuyama","year":"1991","journal-title":"Algorithmica"},{"key":"R21","unstructured":"D. Mili, Self-Healing Ring Architectures for SONET Network Applications. http:\/\/www.doc.ic.ac.uk\/~nd\/surprise_96\/journal\/vol2\/dm9\/article2.html"},{"key":"R22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480195294994","volume":"11","author":"Schrijver","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"R23","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1287\/opre.46.5.719","volume":"46","author":"Sutter","year":"1998","journal-title":"Oper. Res."},{"key":"R24","unstructured":"T.-H. Wu,Fiber Network Service Survivability. Artech House, Inc. (1992)."},{"key":"R25","unstructured":"The SONET Home Page. http:\/\/www.sonet.com"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2004003\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T12:59:02Z","timestamp":1524747542000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2004003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":25,"journal-issue":{"issue":"4"},"alternative-id":["ro03ns"],"URL":"https:\/\/doi.org\/10.1051\/ro:2004003","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}