{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:20:48Z","timestamp":1758824448675},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s0167-6377(01)00053-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:06:51Z","timestamp":1027634811000},"page":"107-111","source":"Crossref","is-referenced-by-count":19,"title":["TSP tour domination and Hamilton cycle decompositions of regular digraphs"],"prefix":"10.1016","volume":"28","author":[{"given":"Gregory","family":"Gutin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"Yeo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(01)00053-0_BIB1","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0167-6377(01)00053-0_BIB2","doi-asserted-by":"crossref","unstructured":"B. Alspach, J.-C. Bermond, D. Sotteau, Decomposition into cycles I: Hamilton decompositions, in: G. Hahn et al. (Eds.), Cycles and Rays, Kluwer, Dordrecht, 1990, pp. 9\u201318.","DOI":"10.1007\/978-94-009-0517-7_2"},{"key":"10.1016\/S0167-6377(01)00053-0_BIB3","unstructured":"E. Balas, N. Simonetti, Linear time dynamic programming algorithms for some new classes of restricted TSP's, Proceedings of the IPCO V, Lecture Notes in Computer Science, Vol. 1084, 1996, pp. 316\u2013329."},{"key":"10.1016\/S0167-6377(01)00053-0_BIB4","series-title":"Digraphs: Theory, Algorithms and Applications","author":"Bang-Jensen","year":"2000"},{"key":"10.1016\/S0167-6377(01)00053-0_BIB5","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0167-6377(01)00053-0_BIB6","unstructured":"R.E. Burkard, V.G. Deineko, G.J. Woeginger, The travelling salesman problem and the PQ-tree, Proceedings of the IPCO V, Lecture Notes in Computer Science, Vol. 1084, 1996, pp. 490\u2013504."},{"key":"10.1016\/S0167-6377(01)00053-0_BIB7","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 Oper. Res."},{"key":"10.1016\/S0167-6377(01)00053-0_BIB8","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\/S0167-6377(01)00053-0_BIB9","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\/S0167-6377(01)00053-0_BIB10","unstructured":"G. Gutin, On an approach for solving the traveling salesman problem, Proceedings of the USSR Conference on System Res. Moscow, 1984, pp. 184\u2013185 (in Russian)."},{"key":"10.1016\/S0167-6377(01)00053-0_BIB11","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":"Comput. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00053-0_BIB12","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":"Comput. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00053-0_BIB13","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\/S0167-6377(01)00053-0_BIB14","unstructured":"R. H\u00e4ggkvist, Series of lectures on Hamilton decomposition, British Combinatorial Conference, Swansea, UK, 1981, International Conference on Convexity and Graph Theory, Israel, March 1981, and Seminar Orsey, France, 1986."},{"key":"10.1016\/S0167-6377(01)00053-0_BIB15","unstructured":"R. H\u00e4ggkvist, Roland.Haggkvist@math.umu.se, personnal communications, 1999\u20132000."},{"key":"10.1016\/S0167-6377(01)00053-0_BIB16","series-title":"Topics on Tournaments","author":"Moon","year":"1968"},{"key":"10.1016\/S0167-6377(01)00053-0_BIB17","unstructured":"C.N. Potts, S.L. van de Velde, Dynaserach\u2014iterative local improvement by dynamic programming: Part I, The traveling salesman problem, Technical Report, University of Twente, The Netherlands, 1995."},{"key":"10.1016\/S0167-6377(01)00053-0_BIB18","doi-asserted-by":"crossref","unstructured":"A.P. Punnen, The traveling salesman problem: new polynomial approximation algorithms and domination analysis, J. Inform. Optim. Sci., to appear.","DOI":"10.1080\/02522667.2001.10699482"},{"key":"10.1016\/S0167-6377(01)00053-0_BIB19","unstructured":"A.P. Punnen, S.N. Kabadi, Domination analysis of some heuristics for the asymmetric traveling salesman problem, submitted."},{"key":"10.1016\/S0167-6377(01)00053-0_BIB20","unstructured":"V.I. Sarvanov, N.N. Doroshko, Approximate solution of the traveling salesman problem by a local algorithm with scanning neighbourhoods of factorial cardinality in cubic time, Software: Algorithms and Programs. Math. Institute of Belorussian Acad. of Sci., Minsk, no. 31, 11\u201313, 1981 (in Russian)."},{"key":"10.1016\/S0167-6377(01)00053-0_BIB21","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0095-8956(80)90044-1","article-title":"A hamiltonian decomposition of K2m*, m\u2a7e 8","volume":"B 29","author":"Tillson","year":"1980","journal-title":"J. Combin. Theory"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000530?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000530?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T14:28:46Z","timestamp":1555684126000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701000530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,4]]}},"alternative-id":["S0167637701000530"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00053-0","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}