{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:00:02Z","timestamp":1743102002418,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664277"},{"type":"electronic","value":"9783540483182"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48318-7_9","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T20:20:56Z","timestamp":1193343656000},"page":"85-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Construction Heuristics and Domination Analysis for the Asymmetric TSP"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2001,7,27]]},"reference":[{"key":"9_CR1","series-title":"Lect Notes Comput Sci","first-page":"316","volume-title":"Proc. IPCO V","author":"E. Balas","year":"1996","unstructured":"E. Balas and N. Simonetti, Linear time dynamic programming algorithms for some new classes of restricted TSP\u2019s. Proc. IPCO V, LNCS 1084, Springer Verlag, 1996, 316\u2013329."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1051\/ro\/1990240302451","volume":"24","author":"J. Carlier","year":"1990","unstructured":"J. Carlier and P. Villon, A new heuristic for the traveling salesman problem. RAIRO24, 245\u2013253 (1990).","journal-title":"RAIRO"},{"key":"9_CR3","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1998","unstructured":"W.J. Cook, W.H. Cunninghan, W.R. Pulleyblank and A. Schrijver, Combinatorial Optimization, Wiley, New York, 1998."},{"key":"9_CR4","series-title":"TR","volume-title":"A study of exponential neighbourhoods for the travelling salesman problem and for the quadratic assignment problem","author":"V. Deineko","year":"1997","unstructured":"V. Deineko and 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":"9_CR5","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1057\/palgrave.jors.2600392","volume":"48","author":"F. Glover","year":"1997","unstructured":"F. Glover and A.P. Punnen, The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms, J. Oper. Res. Soc., 48 (1997) 502\u2013510.","journal-title":"J. Oper. Res. Soc."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0305-0548(98)00064-1","volume":"26","author":"G. Gutin","year":"1999","unstructured":"G. Gutin, Exponential neighbourhood local search for the traveling salesman problem. Computers & Operations Research26 (1999) 313\u2013320.","journal-title":"Computers & Operations Research"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0305-0548(98)00065-3","volume":"26","author":"G. Gutin","year":"1999","unstructured":"G. Gutin and A. Yeo, Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. Computers & Operations Research26 (1999) 321\u2013327.","journal-title":"Computers & Operations Research"},{"unstructured":"G. Gutin and A. Yeo, TSP heuristics with large domination number. Manuscript, 1998.","key":"9_CR8"},{"unstructured":"G. Gutin and A. Yeo, Polynomial approximation algorithms for the TSP and the QAP with factorial domination number (submitted).","key":"9_CR9"},{"unstructured":"G. Gutin and A. Yeo, TSP tour domination and hamiltonian cycle decomposition of regular digraphs (submitted).","key":"9_CR10"},{"key":"9_CR11","volume-title":"Series of lectures on Hamilton decomposition","author":"R. H\u00e4ggkvist","year":"1986","unstructured":"R. H\u00e4ggkvist, Series of lectures on Hamilton decomposition, Seminar Orsey, France, 1986 and Hindsgavl\u2019s Seminar, Denmark, 1994."},{"unstructured":"D.S. Johnson, private communication, 1998.","key":"9_CR12"},{"key":"9_CR13","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"D.S. Johnson","year":"1997","unstructured":"D.S. Johnson and L.A. McGeoch, The traveling salesman problem: a case study in local optimization. Local Search in Combinatorial Optimization, E.H.L. Aarts and J.K. Lenstra (eds.), Wiley, N.Y., 215\u2013310 (1997)."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1137\/0208045","volume":"8","author":"R.M. Karp","year":"1979","unstructured":"R.M. Karp, A patching algorithm for the nonsymmetric Traveling Salesman Problem. SIAM J. Comput.8 (1979) 561\u201373.","journal-title":"SIAM J. Comput."},{"key":"9_CR15","first-page":"181","volume-title":"The Traveling Salesman Problem","author":"R.M. Karp","year":"1985","unstructured":"R.M. Karp and J.M. Steele, Probabilistic analysis of heuristics, in The Traveling Salesman Problem, E.L. Lawler, et al. (eds.), Wiley, N.Y., 1985, pp.181\u2013205."},{"unstructured":"A.P. Punnen, The traveling salesman problem: new polynomial approximation algorithms and domination analysis. Manuscript, December (1996).","key":"9_CR16"},{"unstructured":"A.P. Punnan and S.N. Kabadi, Domination analysis of some heuristics for the asymmetric traveling salesman problem (submitted).","key":"9_CR17"},{"key":"9_CR18","series-title":"Springer Lecture Notes in Computer Sci.","volume-title":"The traveling salesman problem: Computational Solutions for TSP Applications","author":"G. Reinelt","year":"1994","unstructured":"G. Reinelt, The traveling salesman problem: Computational Solutions for TSP Applications. Springer Lecture Notes in Computer Sci.840, Springer-Verlag, Berlin (1994)."},{"key":"9_CR19","volume-title":"Large exponential neighbourhoods for the TSP","author":"A. Yeo","year":"1997","unstructured":"A. Yeo, Large exponential neighbourhoods for the TSP, preprint, Dept of Maths and CS, Odense University, Odense, Denmark, 1997."},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R. Jonker","year":"1987","unstructured":"R. Jonker and A. Volgenant, A shortest augmenting path algorithm for dense and sparse linear assignment problems, Computing38 (1987) 325\u2013340.","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48318-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T09:04:58Z","timestamp":1587805498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48318-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664277","9783540483182"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48318-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}