{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T07:20:38Z","timestamp":1700205638393},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1016\/s0377-2217(02)00804-4","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T18:20:01Z","timestamp":1047666001000},"page":"659-672","source":"Crossref","is-referenced-by-count":5,"title":["Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network"],"prefix":"10.1016","volume":"154","author":[{"given":"J","family":"Cole Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S0377-2217(02)00804-4_BIB1","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1137\/S0097539791199334","article-title":"Improved algorithms for bipartite network flow","volume":"23","author":"Ahuja","year":"1994","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10.1016\/S0377-2217(02)00804-4_BIB2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0377-2217(96)00269-X","article-title":"Computational investigations of maximum flow algorithms","volume":"97","author":"Ahuja","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00804-4_BIB3","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0377-2217(02)00804-4_BIB4","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","article-title":"Facets of the knapsack polytope","volume":"8","author":"Balas","year":"1975","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/S0377-2217(02)00804-4_BIB5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/S0377-2217(97)00021-0","article-title":"Optimal placement of add\/drop multiplexers: Static and dynamic models","volume":"108","author":"Belvaux","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00804-4_BIB6","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":"Telecommunication Systems"},{"key":"10.1016\/S0377-2217(02)00804-4_BIB7","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\u2019Amico","year":"1999","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00804-4_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(02)00804-4_BIB9","doi-asserted-by":"crossref","unstructured":"A.V. Goldberg, Recent developments in maximum flow algorithms, Algorithm Theory: SWAT\u201998 6th Scandinavian Workshop on Algorithm Theory, Proceedings 8\u201310, 1998, pp. 1\u201310","DOI":"10.1007\/BFb0054350"},{"key":"10.1016\/S0377-2217(02)00804-4_BIB10","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","article-title":"A new approach to the maximum-flow problem","volume":"35","author":"Goldberg","year":"1988","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(02)00804-4_BIB11","doi-asserted-by":"crossref","unstructured":"O. Goldschmidt, D.S. Hochbaum, A. Levin, E.V. Olinick, The SONET edge-partition problem, Networks, in press","DOI":"10.1002\/net.10054"},{"key":"10.1016\/S0377-2217(02)00804-4_BIB12","doi-asserted-by":"crossref","unstructured":"O. Goldschmidt, A. Laugier, E.V. Olinick, SONET\/SDH ring assignment with capacity constraints, Discrete Applied Mathematics, in press","DOI":"10.1016\/S0166-218X(02)00236-6"},{"issue":"6","key":"10.1016\/S0377-2217(02)00804-4_BIB13","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/S0305-0548(95)00059-3","article-title":"SONET ring sizing with genetic algorithms","volume":"24","author":"Karunanithi","year":"1997","journal-title":"Computers and Operations Research"},{"issue":"11","key":"10.1016\/S0377-2217(02)00804-4_BIB14","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":"Management Science"},{"key":"10.1016\/S0377-2217(02)00804-4_BIB15","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\/S0377-2217(02)00804-4_BIB16","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":"Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(02)00804-4_BIB17","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1287\/opre.41.2.338","article-title":"A faster strongly polynomial minimum cost flow algorithm","volume":"41","author":"Orlin","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00804-4_BIB18","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/ijoc.12.4.284.11884","article-title":"Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting","volume":"12","author":"Sherali","year":"2000","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00804-4_BIB19","unstructured":"J.C. Smith, A. Schaefer, J. Yen, A Benders\u2019 decomposition approach for solving a stochastic intra-ring synchronous optical network design problem, Working Paper, Department of Systems and Industrial Engineering, University of Arizona, Tucson, 2001"},{"issue":"5","key":"10.1016\/S0377-2217(02)00804-4_BIB20","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":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00804-4_BIB21","series-title":"Fiber Network Service Survivability","author":"Wu","year":"1992"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008044?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008044?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:02:27Z","timestamp":1584489747000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702008044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0377221702008044"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00804-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}