{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T21:41:33Z","timestamp":1781386893761,"version":"3.54.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"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,2]]},"DOI":"10.1016\/s0377-2217(02)00794-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:25:26Z","timestamp":1049721926000},"page":"255-265","source":"Crossref","is-referenced-by-count":4,"title":["A note on the approximation of the asymmetric traveling salesman problem"],"prefix":"10.1016","volume":"153","author":[{"given":"Giovanni","family":"Righini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Trubian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00794-4_BIB1","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/S0036144596297514","article-title":"Well-solvable special cases of the TSP a survey","volume":"40","author":"Burkard","year":"1998","journal-title":"SIAM Review"},{"key":"10.1016\/S0377-2217(02)00794-4_BIB2","unstructured":"N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1975"},{"key":"10.1016\/S0377-2217(02)00794-4_BIB3","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 Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00794-4_BIB4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230120103","article-title":"On the worst-case performance of some algorithms for the asymmetric traveling salesman problem","volume":"12","author":"Frieze","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00794-4_BIB5","unstructured":"M.R. Garey, D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, 1979"},{"key":"10.1016\/S0377-2217(02)00794-4_BIB6","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1287\/opre.28.5.1219","article-title":"Data-dependent bounds for heuristics to find a minimum weight Hamiltonian circuit","volume":"28","author":"Jonker","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00794-4_BIB7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0167-6377(82)90002-5","article-title":"Identification of non-optimal arcs for the TSP","volume":"1","author":"Jonker","year":"1982","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00794-4_BIB8","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/0377-2217(94)00010-A","article-title":"Worst-case analysis of two approximate algorithms for the asymmetric traveling salesman problem","volume":"81","author":"Righini","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00794-4_BIB9","doi-asserted-by":"crossref","unstructured":"S. Sahni, T. Gonzales, P-complete problems and approximate solutions, in: Annual Symposium on Switching and Automata Theory 15th, 1974, pp. 28\u201332","DOI":"10.1109\/SWAT.1974.22"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007944?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007944?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:56:59Z","timestamp":1553914619000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702007944"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0377221702007944"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00794-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}