{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T18:29:39Z","timestamp":1778005779967,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":[[2001,3]]},"DOI":"10.1016\/s0377-2217(99)00468-3","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"555-568","source":"Crossref","is-referenced-by-count":82,"title":["Construction heuristics for the asymmetric TSP"],"prefix":"10.1016","volume":"129","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"Yeo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexey","family":"Zverovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00468-3_BIB1","doi-asserted-by":"crossref","unstructured":"E. Balas, N. Simonetti, Linear time dynamic programming algorithms for some new classes of restricted TSP's, in: Proceedings of IPCO V, Lecture Notes in Computer Science 1084, Springer, Berlin, 1996, pp. 316\u2013329","DOI":"10.1007\/3-540-61310-2_24"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB2","unstructured":"E. Balas, P. Toth, Branch and bound methods, in: E.L. Lawler et al. (Eds.), The Traveling Salesman Problem, Wiley, New York, 1985, pp. 361-401"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1051\/ro\/1990240302451","article-title":"A new heuristic for the traveling salesman problem","volume":"24","author":"Carlier","year":"1990","journal-title":"RAIRO"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB4","doi-asserted-by":"crossref","unstructured":"W.J. Cook, W.H. Cunninghan, W.R. Pulleyblank, A. Schrijver, Combinatorial Optimization, Wiley, New York, 1998","DOI":"10.1002\/9781118033142"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB5","unstructured":"V. Deineko, G.J. Woeginger, A study of exponential neighbourhoods for the travelling salesman problem and for the quadratic assignment problem, TR Woe-05, TU of Graz, Graz, Austria, 1997"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB6","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1057\/palgrave.jors.2600392","article-title":"The travelling salesman problem: New solvable cases and linkages with the development of approximation algorithms","volume":"48","author":"Glover","year":"1997","journal-title":"Journal of Operations Research Society"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0305-0548(98)00064-1","article-title":"Exponential neighbourhood local search for the traveling salesman problem","volume":"26","author":"Gutin","year":"1999","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB8","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0305-0548(98)00065-3","article-title":"Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour","volume":"26","author":"Gutin","year":"1999","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB9","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling-salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB10","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling-salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1971","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB11","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, private communication, 1999","DOI":"10.17660\/ActaHortic.1999.485.25"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB12","doi-asserted-by":"crossref","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, pp. 215\u2013310","DOI":"10.2307\/j.ctv346t9c.13"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB13","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","article-title":"A patching algorithm for the nonsymmetric traveling salesman problem","volume":"8","author":"Karp","year":"1979","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB14","unstructured":"R.M. Karp, J.M. Steele, Probabilistic analysis of heuristics, in: E.L. Lawler et al. (Eds.), The Traveling Salesman Problem, Wiley, New York, 1985, pp. 181\u2013205"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB15","unstructured":"G. Reinelt, The traveling salesman problem: Computational Solutions for TSP Applications, Lecture Notes in Computer Science 840, Springer, Berlin, 1994"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB16","unstructured":"A. Yeo, Large exponential neighbourhoods for the TSP, Preprint, Department of Maths and CS, Odense University, Odense, Denmark, 1997"},{"key":"10.1016\/S0377-2217(99)00468-3_BIB17","unstructured":"W. Zhang, R.E. Korf, On the asymmetric traveling salesman problem under subtour elimination and local search, Manuscript, Department of CS, University of California, LA, 1993"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004683?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004683?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T14:58:42Z","timestamp":1579013922000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799004683"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0377221799004683"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00468-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}