{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T19:47:18Z","timestamp":1776282438538,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":[[1983,1]]},"DOI":"10.1016\/0305-0548(83)90026-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"47-59","source":"Crossref","is-referenced-by-count":232,"title":["Computational experiments with algorithms for a class of routing problems"],"prefix":"10.1016","volume":"10","author":[{"given":"B.L.","family":"Golden","sequence":"first","affiliation":[]},{"given":"J.S.","family":"Dearmon","sequence":"additional","affiliation":[]},{"given":"E.K.","family":"Baker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0305-0548(83)90026-6_BIB1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/net.3230040106","article-title":"Networks and vehicle routing for municipal waste collection","volume":"4","author":"Beltrami","year":"1974","journal-title":"Networks"},{"issue":"2","key":"10.1016\/0305-0548(83)90026-6_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230110204","article-title":"Classification in vehicle routing and scheduling","volume":"11","author":"Bodin","year":"1981","journal-title":"Networks"},{"issue":"6","key":"10.1016\/0305-0548(83)90026-6_BIB3","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/0305-0483(73)90089-3","article-title":"The optimum traversal of a graph","volume":"1","author":"Christofides","year":"1973","journal-title":"Omega"},{"issue":"3","key":"10.1016\/0305-0548(83)90026-6_BIB4","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. Prog."},{"key":"10.1016\/0305-0548(83)90026-6_BIB5","article-title":"A comparison of heuristics for the capacitated Chinese postman problem","author":"DeArmon","year":"1981"},{"key":"10.1016\/0305-0548(83)90026-6_BIB6","article-title":"On two methods for solving minimal perfect matching problems","author":"Derigs","year":"1979"},{"key":"10.1016\/0305-0548(83)90026-6_BIB7","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler tours and the Chinese postman","volume":"4","author":"Edmonds","year":"1973","journal-title":"Math. Prog."},{"issue":"2","key":"10.1016\/0305-0548(83)90026-6_BIB8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230070203","article-title":"Implementing vehicle routing algorithms","volume":"7","author":"Golden","year":"1977","journal-title":"Networks"},{"issue":"3","key":"10.1016\/0305-0548(83)90026-6_BIB9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230110308","article-title":"Capacitated arc routing problems","volume":"11","author":"Golden","year":"1981","journal-title":"Networks"},{"issue":"2","key":"10.1016\/0305-0548(83)90026-6_BIB10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1002\/net.3230110209","article-title":"Combinatorial optimization and vehicle fleet planning: perspectives and prospects","volume":"11","author":"Magnanti","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(83)90026-6_BIB11","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.25.7.643","article-title":"The Chinese postman problem for mixed networks","volume":"25","author":"Minieka","year":"1979","journal-title":"Mngmt Sci."},{"key":"10.1016\/0305-0548(83)90026-6_BIB12","series-title":"Combinatorial Algorithms","author":"Nijenhuis","year":"1975"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054883900266?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054883900266?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:29:32Z","timestamp":1552926572000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054883900266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["0305054883900266"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(83)90026-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}