{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T00:47:37Z","timestamp":1694652457748},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":4064,"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,6]]},"DOI":"10.1016\/s0166-218x(01)00268-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:35:01Z","timestamp":1027582501000},"page":"117-128","source":"Crossref","is-referenced-by-count":22,"title":["Domination analysis of some heuristics for the traveling salesman problem"],"prefix":"10.1016","volume":"119","author":[{"given":"Abraham","family":"Punnen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santosh","family":"Kabadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00268-2_BIB1","unstructured":"E. Balas, N. Simonetti, Linear time dynamic programming algorithms for some new class of restricted TSP's, Proceedings IPCO V, Lecture Notes in Computer Science, Vol. 1084, Springer, Berlin, 1996, pp. 316\u2013329."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB2","unstructured":"R.E. Burkard, V.G. Deineko, G.J. Woeginger, The travelling salesman problem and the PQ-tree, Proceedings IPCO V, Lecture Notes in Computer Science, vol. 1084, Springer, Berlin, 1996, pp. 490\u2013504."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB3","unstructured":"N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, 1976."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB4","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","article-title":"Sequencing a one state-variable machine: a solvable case of the traveling salesman problem","volume":"12","author":"Gilmore","year":"1964","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-6377(92)90049-9","article-title":"Local search and the local structure of NP-complete problems","volume":"12","author":"Grover","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB6","unstructured":"F. Glover, Ejection chains, reference structures, and alternating path algorithms for the traveling salesman problem, Research Report, University of Colorado-Boulder, Graduate School of Business, 1992 (a short version appeared in Discrete Appl. Math. 65 (1996) 223\u2013253)."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB7","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)00268-2_BIB8","unstructured":"G. Gutin, On approach to solving the traveling salesman problem, in: Theory, Methodology, and Practice of System Research, Mathematical Methods of System Analysis, VNIISI, Moscow, 1984, pp. 184\u2013186."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB9","first-page":"1514","article-title":"On the efficiency of a local algorithm for solving the traveling salesman problem","volume":"11","author":"Gutin","year":"1988","journal-title":"Automat. Remote Control (part 2)"},{"key":"10.1016\/S0166-218X(01)00268-2_BIB10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0305-0548(98)00064-1","article-title":"Exponential neighborhood local search for the traveling salesman problem","volume":"26","author":"Gutin","year":"1999","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB11","unstructured":"G. Gutin, A. Yeo, TSP heuristics with large domination number, Technical Report No 12\/98, Department of Maths and Stats, Brunel University, 1998."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB12","doi-asserted-by":"crossref","unstructured":"G. Gutin, A. Yeo, Polynomial algorithms for the TSP and the QAP with a factorial domination number, Discrete Appl. Math. 119 (2002) 107\u2013116.","DOI":"10.1016\/S0166-218X(01)00267-0"},{"key":"10.1016\/S0166-218X(01)00268-2_BIB13","first-page":"329","article-title":"Gilmore\u2013Gomory type traveling salesman problem","volume":"26","author":"Kabadi","year":"1999","journal-title":"Comput. Oper. Res. Special issue on Traveling Salesman Problem"},{"key":"10.1016\/S0166-218X(01)00268-2_BIB14","series-title":"The Traveling Salesman Problem","author":"Lawler","year":"1985"},{"key":"10.1016\/S0166-218X(01)00268-2_BIB15","unstructured":"C.N. Potts, S.L. Van de Velde, Dynasearch \u2014 iterative local improvement by dynamic programming: Part I, The traveling salesman problem, Technical Report, University of Twente, The Netherlands, 1995."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB16","first-page":"191","article-title":"The traveling salesman problem: new polynomial approximation algorithms and domination analysis","volume":"22","author":"Punnen","year":"2001","journal-title":"J. Inform. Optim."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB17","unstructured":"A.P. Punnen, F. Margot, S.N. Kabadi, TSP heuristics: domination analysis and complexity, Technical Report 2001-06, Department of Mathematics, University of Kentucky, USA."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB18","unstructured":"V.I. Rublineckii, Estimates of the accuracy of procedures in the traveling salesman problem, Numer. Math. Comput. Technol. IV (1973) 18\u201323 (Russian)."},{"issue":"2","key":"10.1016\/S0166-218X(01)00268-2_BIB19","first-page":"111","article-title":"The mean value of the functional of the assignment problem","volume":"143","author":"Sarvanov","year":"1976","journal-title":"Vestsf. Akad. Navuk BSSR Ser. Fiz. -Mat. Navuk"},{"key":"10.1016\/S0166-218X(01)00268-2_BIB20","unstructured":"V.I. Sarvanov, N.N. Doroshko, Approximate solution of the traveling salesman problem by a local algorithm with scanning neighborhoods of factorial cardinality in cubic time, in: Software: Algorithms and Programs, Mathematics Institute of the Belorussia Academy of Science, Minsk, No. 31, 1981, pp. 11\u201313 (in Russian)."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB21","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problem","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(01)00268-2_BIB22","unstructured":"V.G. Vizing, Values of the target functional in a priority problem that are majorized by the mean value, Kibernetika (Kiev) 5 (1973), 76\u201378 (Russian)."},{"key":"10.1016\/S0166-218X(01)00268-2_BIB23","unstructured":"A. Yeo, Large exponential neighborhoods for the traveling salesman problem, Preprint No. 47, Department of Maths and CS, Odense University, 1997."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002682?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002682?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T13:24:33Z","timestamp":1556717073000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0166218X01002682"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00268-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}