{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T23:54:09Z","timestamp":1705967649537},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3699,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0166-218x(02)00236-6","type":"journal-article","created":{"date-parts":[[2002,10,30]],"date-time":"2002-10-30T21:44:51Z","timestamp":1036014291000},"page":"99-128","source":"Crossref","is-referenced-by-count":50,"title":["SONET\/SDH ring assignment with capacity constraints"],"prefix":"10.1016","volume":"129","author":[{"given":"Olivier","family":"Goldschmidt","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Laugier","sequence":"additional","affiliation":[]},{"given":"Eli V.","family":"Olinick","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0166-218X(02)00236-6_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/90.759310","article-title":"Scalable wdm access network architecture based on photonic slot routing","volume":"7","author":"Chlamtac","year":"1999","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"1","key":"10.1016\/S0166-218X(02)00236-6_BIB2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/inte.25.1.20","article-title":"SONET toolkit: a decision support system for designing robust and cost-effective fiber-optic networks","volume":"25","author":"Cosares","year":"1995","journal-title":"Interfaces"},{"key":"10.1016\/S0166-218X(02)00236-6_BIB3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02110141","article-title":"An optimization problem related to balancing loads on SONET rings","volume":"3","author":"Cosares","year":"1994","journal-title":"Telecommun. Syst."},{"key":"10.1016\/S0166-218X(02)00236-6_BIB4","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0167-6377(99)00031-0","article-title":"Exact solution of the SONET ring loading problem","volume":"25","author":"Dell'Amico","year":"1999","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"10.1016\/S0166-218X(02)00236-6_BIB5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230260206","article-title":"The symmetric generalized traveling salesman polytope","volume":"26","author":"Fischetti","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00236-6_BIB6","unstructured":"O. Goldschmidt, D. Hochbaum, E.V. Olinick, The SONET edge-partitioning problem, Working Paper available online at http:\/www.engr.smu.edu\/~olinick\/papers\/sepp.ps."},{"issue":"2","key":"10.1016\/S0166-218X(02)00236-6_BIB7","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/bltj.2047","article-title":"A polynomial time approximation scheme for the sonet ring loading problem","volume":"2","author":"Khanna","year":"1997","journal-title":"Bell Labs Tech. J."},{"issue":"11","key":"10.1016\/S0166-218X(02)00236-6_BIB8","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.40.11.1533","article-title":"Clustering for the design of SONET rings in interoffice telecommunications","volume":"40","author":"Laguna","year":"1994","journal-title":"Manage. Sci."},{"issue":"3","key":"10.1016\/S0166-218X(02)00236-6_BIB9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/(SICI)1097-0037(200005)35:3<223::AID-NET6>3.0.CO;2-J","article-title":"A branch-and-cut algorithm for solving an intra-ring synchronous optical network design problem","volume":"35","author":"Lee","year":"2000","journal-title":"Networks"},{"issue":"1","key":"10.1016\/S0166-218X(02)00236-6_BIB10","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/opre.45.1.148","article-title":"Optimal load balancing on SONET bidirectional rings","volume":"45","author":"Myung","year":"1997","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/S0166-218X(02)00236-6_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480195294994","article-title":"The ring loading problem","volume":"11","author":"Schrijver","year":"1998","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"10.1016\/S0166-218X(02)00236-6_BIB12","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1287\/opre.46.5.719","article-title":"Optimal placement of add\/drop multiplexers: heuristic and exact algorithms","volume":"46","author":"Sutter","year":"1998","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(02)00236-6_BIB13","doi-asserted-by":"crossref","unstructured":"D. Wagner, F. Wagner, Between min cut and graph bisection, Lecture Notes in Computer Science, Vol. 711, Springer, New York, 1993, pp. 744\u2013750.","DOI":"10.1007\/3-540-57182-5_65"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002366?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002366?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T13:25:28Z","timestamp":1555161928000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0166218X02002366"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00236-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}