{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T03:35:20Z","timestamp":1783481720055,"version":"3.55.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0166-218x(01)00195-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:52:51Z","timestamp":1027583571000},"page":"81-86","source":"Crossref","is-referenced-by-count":172,"title":["Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP"],"prefix":"10.1016","volume":"117","author":[{"given":"Gregory","family":"Gutin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anders","family":"Yeo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexey","family":"Zverovich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00195-0_BIB1","doi-asserted-by":"crossref","unstructured":"J. Cirasella, D.S. Johnson, L.A. McGeoch, W. Zhang, The asymmetric traveling salesman problem: algorithms, instance generators and tests, Proceedings of third Workshop on Algorithm Engineering and Experiments (ALENEX 01), Washington DC, 2001, to appear.","DOI":"10.1007\/3-540-44808-X_3"},{"key":"10.1016\/S0166-218X(01)00195-0_BIB2","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/S0377-2217(99)00468-3","article-title":"Construction heuristics for the asymmetric traveling salesman problem","volume":"129","author":"Glover","year":"2001","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00195-0_BIB3","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1057\/palgrave.jors.2600392","article-title":"The traveling salesman problem: new solvable cases and linkages with the development of approximation algorithms","volume":"48","author":"Glover","year":"1997","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(01)00195-0_BIB4","doi-asserted-by":"crossref","unstructured":"G. Gutin, A. Yeo, Polynomial approximation algorithms for the TSP and the QAP with factorial domination number, Discrete Appl. Math., to appear.","DOI":"10.1016\/S0166-218X(01)00267-0"},{"key":"10.1016\/S0166-218X(01)00195-0_BIB5","doi-asserted-by":"crossref","unstructured":"G. Gutin, A. Yeo, TSP tour domination and Hamilton cycle decomposition of regular digraphs, Oper. Res. Lett., to appear.","DOI":"10.1016\/S0167-6377(01)00053-0"},{"key":"10.1016\/S0166-218X(01)00195-0_BIB6","unstructured":"G. Gutin, A. Zverovich, Evaluation of the Contract-or-Patch Heuristic for the Asymmetric TSP, submitted for publication."},{"key":"10.1016\/S0166-218X(01)00195-0_BIB7","unstructured":"D.S. Johnson, L.A. McGeoch, The traveling salesman problem: a case study in local optimization. in: E.H.L. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, New York, 1997, 215\u2013310."},{"key":"10.1016\/S0166-218X(01)00195-0_BIB8","unstructured":"A.P. Punnen, S. Kabadi, Domination analysis of some heuristics for the asymmetric traveling salesman problem, submitted."},{"key":"10.1016\/S0166-218X(01)00195-0_BIB9","unstructured":"G. Reinelt, The Traveling Salesman Problem: Computational Solutions for TSP Applications Springer Lecture Notes in Computer Science 840, 1994, Springer-Verlag, Berlin."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001950?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001950?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T23:51:03Z","timestamp":1557100263000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01001950"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0166218X01001950"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00195-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}