{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:23Z","timestamp":1759637783009},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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":[[2003,3]]},"DOI":"10.1016\/s0377-2217(02)00222-9","type":"journal-article","created":{"date-parts":[[2002,12,2]],"date-time":"2002-12-02T16:31:35Z","timestamp":1038846695000},"page":"557-568","source":"Crossref","is-referenced-by-count":11,"title":["Differential approximation results for the traveling salesman problem with distances 1 and 2"],"prefix":"10.1016","volume":"145","author":[{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophie","family":"Toulouse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00222-9_BIB1","first-page":"51","article-title":"Computational complexity: The problem of approximation","volume":"vol. I","author":"Aiello","year":"1986"},{"key":"10.1016\/S0377-2217(02)00222-9_BIB2","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/0022-0000(80)90046-X","article-title":"Structure preserving reductions among convex optimization problems","volume":"21","author":"Ausiello","year":"1980","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0377-2217(02)00222-9_BIB3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(80)90006-7","article-title":"Towards a unified approach for the classification of NP-complete optimization problems","volume":"12","author":"Ausiello","year":"1980","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0377-2217(02)00222-9_BIB4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF01585569","article-title":"The complexity of approximating a nonlinear program","volume":"69","author":"Bellare","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00222-9_BIB5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0304-3975(97)00099-6","article-title":"Differential approximation algorithms for some combinatorial optimization problems","volume":"209","author":"Demange","year":"1998","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0377-2217(02)00222-9_BIB6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(95)00060-7","article-title":"On an approximation measure founded on the links between optimization and polynomial approximation theory","volume":"158","author":"Demange","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0377-2217(02)00222-9_BIB7","doi-asserted-by":"crossref","unstructured":"L. Engebretsen, M. Karpinski, Approximation hardness of TSP with bounded metrics, Report 89, Electronic Colloquium of Computational Complexity, 2000","DOI":"10.1007\/3-540-48224-5_17"},{"key":"10.1016\/S0377-2217(02)00222-9_BIB8","series-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(02)00222-9_BIB9","unstructured":"D.B. Hartvigsen, Extensions of matching theory, Ph.D. Thesis, Carnegie-Mellon University, 1984"},{"key":"10.1016\/S0377-2217(02)00222-9_BIB10","unstructured":"J. Monnot, V.T. Paschos, S. Toulouse, Differential approximation results for the traveling salesman problem, Cahier du LAMSADE 172, LAMSADE, Universit\u00e9 Paris-Dauphine, 2000"},{"key":"10.1016\/S0377-2217(02)00222-9_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.18.1.1","article-title":"The traveling salesman problem with distances one and two","volume":"18","author":"Papadimitriou","year":"1993","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(02)00222-9_BIB12","first-page":"80","article-title":"An algorithm with an estimate for the traveling salesman problem of the maximum","volume":"25","author":"Serdyukov","year":"1984","journal-title":"Upravlyaemye Sistemy"},{"key":"10.1016\/S0377-2217(02)00222-9_BIB13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581085","article-title":"Approximation algorithms for indefinite quadratic programming","volume":"57","author":"Vavasis","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00222-9_BIB14","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/moor.6.3.319","article-title":"Measuring the quality of approximate solutions to zero\u2013one programming problems","volume":"6","author":"Zemel","year":"1981","journal-title":"Mathematics of Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002229?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002229?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T09:12:25Z","timestamp":1580893945000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702002229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0377221702002229"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00222-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}