{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:09:29Z","timestamp":1759666169760},"reference-count":21,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1016\/s0305-0548(96)00081-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"883-897","source":"Crossref","is-referenced-by-count":26,"title":["A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach"],"prefix":"10.1016","volume":"24","author":[{"given":"Chae Y.","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seok J.","family":"Koh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00081-0_BIB1","series-title":"Proc. of IEEE Globecom","first-page":"471","article-title":"Mesh\/Arc networking: an architecture for efficient survivable self-healing networks","author":"Brown","year":"1994"},{"issue":"1","key":"10.1016\/S0305-0548(96)00081-0_BIB2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/49.265706","article-title":"Network design sensitivity studies for use of digital cross-connect systems in survivable network architectures","volume":"12","author":"Doverspike","year":"1994","journal-title":"IEEE Journal of Selected Area Communication"},{"key":"10.1016\/S0305-0548(96)00081-0_BIB3","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1137\/0403043","article-title":"Integer polyhedra associated with certain network design problem with connectivity constraints","volume":"3","author":"Grotschel","year":"1990","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"2","key":"10.1016\/S0305-0548(96)00081-0_BIB4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1287\/opre.40.2.309","article-title":"Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints","volume":"40","author":"Grotschel","year":"1992","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/S0305-0548(96)00081-0_BIB5","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/0360-8352(95)00036-Z","article-title":"A tabu search for the survivable fiber optic communication networks design","volume":"28","author":"Koh","year":"1995","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0305-0548(96)00081-0_BIB6","article-title":"The SONET toolkit prototype: functional requirements","author":"Saniee","year":"1991","journal-title":"Bellcore Technical Memorandom, TM-OPT-020219"},{"issue":"4","key":"10.1016\/S0305-0548(96)00081-0_BIB7","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1109\/24.93762","article-title":"An algorithm for designing rings for survivable fiber networks","volume":"40","author":"Wasem","year":"1991","journal-title":"IEEE Translation Reliability"},{"issue":"1","key":"10.1016\/S0305-0548(96)00081-0_BIB8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1109\/49.265719","article-title":"Survivable SONET networks-design methodology","volume":"12","author":"Wasem","year":"1994","journal-title":"IEEE Journal of Selected Areas in Communication"},{"key":"10.1016\/S0305-0548(96)00081-0_BIB9","series-title":"Fiber Network Service Survivability","author":"Wu","year":"1992"},{"issue":"11","key":"10.1016\/S0305-0548(96)00081-0_BIB10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/35.60376","article-title":"Feasibility study of a high-speed SONET self-healing ring architecture in future interoffice networks","volume":"28","author":"Wu","year":"1990","journal-title":"IEEE Communication Magazine"},{"issue":"4","key":"10.1016\/S0305-0548(96)00081-0_BIB11","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/24.93761","article-title":"A multi-period design model for survivable network architecture selection for SONET interoffice networks","volume":"40","author":"Wu","year":"1991","journal-title":"IEEE Translation Reliability"},{"issue":"11","key":"10.1016\/S0305-0548(96)00081-0_BIB12","doi-asserted-by":"crossref","first-page":"1698","DOI":"10.1109\/50.9987","article-title":"Survivable network architecture for broadband fiber optic network: model and performance comparison","volume":"6","author":"Wu","year":"1988","journal-title":"IEEE Journal of Lightwave Technology"},{"key":"10.1016\/S0305-0548(96)00081-0_BIB13","series-title":"A SONET dual-homing architecture problem: single ring case","author":"Lee","year":"1994"},{"issue":"3","key":"10.1016\/S0305-0548(96)00081-0_BIB14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0305-0548(96)00028-7","article-title":"Balancing loads on sonet rings with integer demand splitting","volume":"24","author":"Chang","year":"1997","journal-title":"Computers and Operational Research"},{"key":"10.1016\/S0305-0548(96)00081-0_BIB15","series-title":"Proc. IEEE Globecom","first-page":"489","article-title":"SONET bidirectional ring capacity analysis: pragmatic view","author":"Smith","year":"1994"},{"issue":"4","key":"10.1016\/S0305-0548(96)00081-0_BIB16","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","article-title":"Optimal solution of vehicle routing problems using minimum K-trees","volume":"42","author":"Fisher","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00081-0_BIB17","series-title":"Network Flows: Theory, Algorithms and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0305-0548(96)00081-0_BIB18","series-title":"Using the CPLEX callable Library and CPLEX Mixed Integer Library","year":"1993"},{"key":"10.1016\/S0305-0548(96)00081-0_BIB19","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search\u2014part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0305-0548(96)00081-0_BIB20","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search\u2014part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0305-0548(96)00081-0_BIB21","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithm","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM Journal of Computing"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000810?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000810?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:21:18Z","timestamp":1555190478000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":21,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0305054896000810"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00081-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}