{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T17:07:10Z","timestamp":1762016830429},"reference-count":23,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"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":[[1994,4]]},"DOI":"10.1016\/0305-0548(94)90029-9","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"421-431","source":"Crossref","is-referenced-by-count":22,"title":["Topological design of ring networks"],"prefix":"10.1016","volume":"21","author":[{"given":"Kemal","family":"Altinkemer","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90029-9_BIB1","doi-asserted-by":"crossref","DOI":"10.1145\/861.871","article-title":"Local networks.","volume":"16","author":"Stalings","year":"1984","journal-title":"Comput. Surv."},{"key":"10.1016\/0305-0548(94)90029-9_BIB2","series-title":"Local Networks, An Introduction","author":"Stallings","year":"1987"},{"key":"10.1016\/0305-0548(94)90029-9_BIB3","series-title":"Design issues in large networks of personnel computers. Working paper","author":"Gavish","year":"1988"},{"key":"10.1016\/0305-0548(94)90029-9_BIB4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0140-3664(79)90091-4","article-title":"Survey of computer communications loop networks: Part 1","volume":"2","author":"Penney","year":"1979","journal-title":"Comp. Commun."},{"key":"10.1016\/0305-0548(94)90029-9_BIB5","article-title":"Routing and scheduling of vehicles and crews the state of the art","volume":"10","author":"Bodin","year":"1983","journal-title":"Computer ops. Res."},{"key":"10.1016\/0305-0548(94)90029-9_BIB6","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","article-title":"An algorithm for the vehicle dispatching problem","volume":"20","author":"Christofides","year":"1969","journal-title":"Ops res. Q"},{"key":"10.1016\/0305-0548(94)90029-9_BIB7","series-title":"The Vehicle Routing Problem \u2018Combinatorial Optimization\u2019","author":"Christofides","year":"1979"},{"key":"10.1016\/0305-0548(94)90029-9_BIB8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","article-title":"Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations","volume":"20","author":"Christofides","year":"1981","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(94)90029-9_BIB9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A generalized assignment heuristic for vehicle routing","volume":"111","author":"Fisher","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(94)90029-9_BIB10","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","article-title":"Approximation algorithms for some routing problems","volume":"7","author":"Frederickson","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0305-0548(94)90029-9_BIB11","series-title":"TIMS XXVI International Meeting","article-title":"The delivery problem\u2014new cutting plane procedures","author":"Gavish","year":"1984"},{"key":"10.1016\/0305-0548(94)90029-9_BIB12","article-title":"Scheduling and routing in transportation and distribution systems: formulations and new relaxations","author":"Gavish","year":"1981"},{"key":"10.1016\/0305-0548(94)90029-9_BIB13","article-title":"An approach for solving a class of transportation scheduling problems","volume":"3","author":"Gavish","year":"1978","journal-title":"Eur. J. ops Res."},{"key":"10.1016\/0305-0548(94)90029-9_BIB14","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/ijoc.2.1.64","article-title":"Worst case analysis of heuristics for multidepot capacitated vehicle routing problems","volume":"2","author":"Li","year":"1990","journal-title":"Orsa J. Comput."},{"key":"10.1016\/0305-0548(94)90029-9_BIB15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","article-title":"Complexity of vehicle routing and scheduling problems","volume":"11","author":"Lenstra","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(94)90029-9_BIB16","series-title":"Proceedings of IEEE-INFOCOM'86","first-page":"130","article-title":"A parallel savings heuristic for the topological design of local access tree networks","author":"Gavish","year":"1986"},{"key":"10.1016\/0305-0548(94)90029-9_BIB17","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.39.3.456","article-title":"Parallel savings based heuristics for the delivery problem","volume":"39","author":"Altinkemer","year":"1991","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90029-9_BIB18","doi-asserted-by":"crossref","unstructured":"B. Gavish and K. Srikanth, Optimal solution methods for large scale multiple travelling salesman problem. Ops. Res. 34, 698\u2013717.","DOI":"10.1287\/opre.34.5.698"},{"key":"10.1016\/0305-0548(94)90029-9_BIB19","author":"Christofides","year":"1976"},{"key":"10.1016\/0305-0548(94)90029-9_BIB20","first-page":"49","article-title":"Heuristics with constant error guarantees for the multi center capacitated minimum spanning tree problem","volume":"13","author":"Altinkemer","year":"1992","journal-title":"J. inform. optimiz. Sci."},{"key":"10.1016\/0305-0548(94)90029-9_BIB21","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.10.4.527","article-title":"Bounds and heuristics for capacitated routing problems","volume":"10","author":"Haimovich","year":"1985","journal-title":"Math. ops Res."},{"key":"10.1016\/0305-0548(94)90029-9_BIB22","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/BF01588956","article-title":"Tight bound for Christofides' travelling salesman heuristic","volume":"14","author":"Cornuejols","year":"1978","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(94)90029-9_BIB23","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0167-6377(87)90012-5","article-title":"Heuristics for unequal weight delivery problems with a fixed error guarantee","volume":"6","author":"Altinkemer","year":"1987","journal-title":"Ops res. Lett."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900299?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900299?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T10:27:56Z","timestamp":1585045676000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["0305054894900299"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90029-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}