{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:25:48Z","timestamp":1774945548631,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1975,9,1]],"date-time":"1975-09-01T00:00:00Z","timestamp":178761600000},"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":[[1975,9]]},"DOI":"10.1016\/0305-0548(75)90015-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"115-119","source":"Crossref","is-referenced-by-count":163,"title":["The clustered traveling salesman problem"],"prefix":"10.1016","volume":"2","author":[{"given":"James A.","family":"Chisman","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(75)90015-5_BIB1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","article-title":"Solution of a large-scale traveling-salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Ops Res."},{"issue":"1","key":"10.1016\/0305-0548(75)90015-5_BIB2","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.7.1.58","article-title":"On a linear-programming combinatorial approach to the traveling-salesman problem","volume":"7","author":"Dantzig","year":"1959","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(75)90015-5_BIB3","series-title":"Principles of Operations Research with Applications to Managerial Decisions","author":"Wagner","year":"1969"},{"issue":"1","key":"10.1016\/0305-0548(75)90015-5_BIB4","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling-salesman problem and minimum spanning trees","volume":"1","author":"Held","year":"1971","journal-title":"Mathematical Programming (Netherlands)"},{"issue":"2","key":"10.1016\/0305-0548(75)90015-5_BIB5","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling-salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(75)90015-5_BIB6","article-title":"Linear Programming with Pattern Constraints","author":"Eastman","year":"1958"},{"issue":"2","key":"10.1016\/0305-0548(75)90015-5_BIB7","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","article-title":"An algorithm for the traveling salesman problem","volume":"11","author":"Little","year":"1963","journal-title":"Ops Res."},{"issue":"4","key":"10.1016\/0305-0548(75)90015-5_BIB8","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1057\/jors.1972.79","article-title":"Algorithms for large-scale traveling salesman problems","volume":"23","author":"Christofides","year":"1972","journal-title":"OplRes. Q."},{"issue":"1","key":"10.1016\/0305-0548(75)90015-5_BIB9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1057\/jors.1971.19","article-title":"Some methods of producing approximate solutions to traveling salesman problems with hundreds or thousands of cities","volume":"22","author":"Webb","year":"1971","journal-title":"Opl Res. Q."},{"issue":"3","key":"10.1016\/0305-0548(75)90015-5_BIB10","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":"Opl Res. Q."},{"issue":"11","key":"10.1016\/0305-0548(75)90015-5_BIB11","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1287\/mnsc.18.11.664","article-title":"An upperbound algorithm for the single and multiple terminal delivery problem","volume":"18","author":"Tillman","year":"1972","journal-title":"Mgmt Sci."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054875900155?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054875900155?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:24:19Z","timestamp":1552926259000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054875900155"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,9]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1975,9]]}},"alternative-id":["0305054875900155"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(75)90015-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1975,9]]}}}