{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T16:46:56Z","timestamp":1777135616135,"version":"3.51.4"},"reference-count":83,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"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":3911,"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,11]]},"DOI":"10.1016\/s0166-218x(01)00338-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"75-102","source":"Crossref","is-referenced-by-count":481,"title":["A survey of very large-scale neighborhood search techniques"],"prefix":"10.1016","volume":"123","author":[{"given":"Ravindra K.","family":"Ahuja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d6zlem","family":"Ergun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James B.","family":"Orlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00338-9_BIB1","series-title":"Local Search in Combinatorial Optimization","author":"Aarts","year":"1997"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB2","unstructured":"R.K. Ahuja, J.B. Orlin, D. Sharma, New neighborhood search structures for the capacitated minimum spanning tree problem, Research Report 99-2, Department of Industrial & Systems Engineering, University of Florida, 1999."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0305-0548(86)90060-2","article-title":"Bottleneck assignment problem under categorization","volume":"13","author":"Aggarwal","year":"1986","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB4","first-page":"645","article-title":"On the solution of traveling salesman problems","author":"Applegate","year":"1998","journal-title":"Documenta Math. ICM"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear time algorithms for NP-hard problems restricted to partial k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02253612","article-title":"Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood","volume":"54","author":"Burkard","year":"1995","journal-title":"Computing"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB7","doi-asserted-by":"crossref","unstructured":"R.E. Burkard, V.G. Deineko, G.J. Woeginger, The travelling salesman problem and the PQ-tree, Mathematics of Operations Reserach 23 (1998) 613\u2013623.","DOI":"10.1287\/moor.23.3.613"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB8","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\/S0166-218X(01)00338-9_BIB9","unstructured":"R.K. Congram, C.N. Potts, S.L. van de Velde, An iterated dynasearch algorithm for the single machine total weighted tardiness scheduling problem, 1998, paper in preparation."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02591867","article-title":"Halin graphs and the traveling salesman problem","volume":"26","author":"Cornuejols","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB11","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","article-title":"A method for solving traveling-salesman problems","volume":"6","author":"Croes","year":"1958","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB12","unstructured":"V. Deineko, G.J. Woeginger, A study of exponential neighborhoods for the traveling salesman problem and the quadratic assignment problem, Report Woe-05, Technical University Graz, 1997."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/ijoc.6.2.141","article-title":"Fast clustering algorithms","volume":"6","author":"Dorndorf","year":"1994","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB14","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","article-title":"Nurse scheduling with tabu search and strategic oscillation","volume":"106","author":"Dowsland","year":"1998","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0305-0548(86)90062-6","article-title":"A vehicle routing improvement algorithm comparison of a \u201cgreedy\u201d and a \u201cmatching\u201d implementation for inventory routing","volume":"13","author":"Dror","year":"1986","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB16","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TCAD.1985.1270101","article-title":"A procedure for placement of standard cell VLSI circuits","volume":"4","author":"Dunlop","year":"1985","journal-title":"IEEE Trans. Comput.-Aided Design"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB17","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0166-218X(96)00132-1","article-title":"Constructing efficient simulated annealing algorithms","volume":"77","author":"Duque-Anton","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB18","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1137\/0214064","article-title":"Optimum communication spanning trees in series parallel networks","volume":"14","author":"El-Mallah","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB19","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1057\/jors.1990.119","article-title":"On a principle of chain exchange for vehicle routing problems (I-VRP)","author":"Fahrion","year":"1990","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB20","doi-asserted-by":"crossref","unstructured":"C.M. Fiduccia, R.M. Mattheyses, A linear time heuristic for improving network partitions, in: ACM IEEE Nineteenth Design Automation Conference Proceedings, IEEE Computer Society, Los Alamitos, CA, 1982, pp. 175\u2013181.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB21","unstructured":"R.T. Firla, B. Spille, R. Weismantel, A primal analogue of cutting plane algorithms, Department of Mathematics, Otto-von-Guericke-University Magdeburg, 1999."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB22","unstructured":"R.T. Firla, B. Spille, R. Weismantel, personal communication."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB23","unstructured":"A. Frangioni, E. Necciari, M.G. Scutella, Multi-exchange algorithms for the minimum makespan machine scheduling problem, Dipartimento di Informatica, University of Pisa, 2000, paper in preparation."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB24","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1006\/jagm.1995.1018","article-title":"Data structures for traveling salesman","volume":"16","author":"Fredman","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB25","unstructured":"M. Gendreau, F. Guertin, J.Y. Potvin, R. Seguin, Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries, CRT-98-10, 1998."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB26","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)00338-9_BIB27","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF00247211","article-title":"Finding the best traveling salesman 4-opt move in the same time as a best 2-opt move","volume":"2","author":"Glover","year":"1996","journal-title":"J. Heuristics"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB28","doi-asserted-by":"crossref","unstructured":"F. Glover, G.M. Gutin, A. Yeo, Zverovich, Construction heuristics and domination analysis for the asymmetric TSP, Research Report, Brunel University, 1999.","DOI":"10.1007\/3-540-48318-7_9"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB29","series-title":"Tabu Search","author":"Glover","year":"1997"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB30","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."},{"issue":"part 2","key":"10.1016\/S0166-218X(01)00338-9_BIB31","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"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB32","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)00338-9_BIB33","unstructured":"G.M. Gutin, A. Yeo, Polynomial algorithms for the TSP and the QAP with a factorial domination number, Manuscript, Brunel University, UK, 1998."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB34","unstructured":"G.M. Gutin, A. Yeo, TSP heuristics with large domination number, Report 12\/98, Department of Mathematics and Statistics, Brunel University, UK, 1998."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB35","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0305-0548(98)00065-3","article-title":"Small diameter neighborhood graphs for the traveling salesman problem","volume":"26","author":"Gutin","year":"1999","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB36","unstructured":"G.M. Gutin, A. Yeo, TSP tour domination and Hamiltonian cycle decomposition of regular digraphs, Manuscript, Brunel University, UK, 1999."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB37","doi-asserted-by":"crossref","unstructured":"K. Helsgaun, An effective implementation of the Lin\u2013Kernighan traveling salesman heuristic, Manuscript, Roskilde University, Denmark, 1999.","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB38","doi-asserted-by":"crossref","unstructured":"J. Hurink, An exponential neighborhood for a one machine batching problem, OR Spektrum 21 (1999) 461\u2013476.","DOI":"10.1007\/s002910050098"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB39","unstructured":"D.S. Johnson, Local search and the traveling salesman problem, in: Proceedings of 17th International Colloquium on Automata Languages and Programming, Lecture Notes in Computer Science, Springer, Berlin, 1990, pp. 443\u2013460."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB40","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, L.A. McGeoch, The travelling 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\/S0166-218X(01)00338-9_BIB41","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","article-title":"A patching algorithm for the non-symmetric traveling salesman problem","volume":"8","author":"Karp","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB42","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB43","unstructured":"P.S. Klyaus, The structure of the optimal solution of certain classes of the traveling salesman problems, Vestsi Akad. Nauk BSSR, Phys. Math. Sci., Minsk, (1976) 95\u201398 (in Russian)."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB44","series-title":"Optimality conditions and exact neighborhoods for sequencing problems, Universitat Osnabruck, Fachbereich Mathematik\/Informatik","author":"Knust","year":"1997"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB45","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0377-2217(93)E0174-V","article-title":"Tabu search for multilevel generalized assignment problem","volume":"82","author":"Laguna","year":"1995","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB46","series-title":"The Traveling Salesman Problem","author":"Lawler","year":"1985"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB47","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions to the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB48","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB49","first-page":"127","article-title":"A modified Lin\u2013Kernighan traveling salesman heuristic","volume":"13","author":"Mak","year":"1992","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB50","first-page":"3","article-title":"The traveling salesman problem: approximation algorithms","volume":"11","author":"Melamed","year":"1989","journal-title":"Avtomati Telemekh"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB51","doi-asserted-by":"crossref","unstructured":"C.H. Papadimitriou, The complexity of Lin\u2013Kernighan algorithm, SIAM J. Comput. (1992) 450\u2013465.","DOI":"10.1137\/0221030"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB52","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB53","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0166-218X(96)00123-0","article-title":"TSP ejection chains","volume":"76","author":"Pesch","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB54","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0020-0190(98)00094-5","article-title":"A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph","volume":"67","author":"Phillips","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB55","unstructured":"C.N. Potts, S.L. van de Velde, Dynasearch\u2014Iterative 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)00338-9_BIB56","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\/S0166-218X(01)00338-9_BIB57","unstructured":"A.P. Punnen, F. Glover, Ejection chains with combinatorial leverage for the TSP, Research Report, University of Colorado-Boulder, 1996."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB58","unstructured":"A.P. Punnen, S.N. Kabadi, Domination analysis of heuristics for the asymmetric traveling salesman problem, Manuscript, University of New Brunswick, 1998."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB59","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/S0377-2217(97)00288-9","article-title":"Relaxed tours and path ejections for the traveling salesman problem","volume":"106","author":"Rego","year":"1998","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB60","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1287\/mnsc.44.10.1447","article-title":"A subpath ejection method for the vehicle routing problem","volume":"44","author":"Rego","year":"1998","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB61","series-title":"Meta-Heuristics: Theory and Applications","article-title":"A parallel tabu search algorithm using ejection chains for the vehicle routing problem","author":"Rego","year":"1996"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB62","series-title":"The traveling salesman computational solutions for TSP application","volume":"Vol. 840","author":"Reinelt","year":"1994"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB63","series-title":"Network Flows and Monotropic Optimization","author":"Rockafellar","year":"1984"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB64","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, Software: Algorithms and Programs, Vol. 31, Mathematics Institute of the Belorussia Academy of Science, Minsk, 1981, pp. 11\u201313 (in Russian)."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB65","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1137\/0214057","article-title":"A linear time algorithm for computing k-terminal reliability in series parallel networks","volume":"14","author":"Satyanarayana","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB66","doi-asserted-by":"crossref","DOI":"10.1287\/opre.46.2.231","article-title":"A scaling algorithm for multicommodity flow problems","volume":"46","author":"Schneur","year":"1998","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB67","doi-asserted-by":"crossref","unstructured":"N. Simonetti, E. Balas, Implementation of a linear time algorithm for certain generalized traveling salesman problems, in: Proceedings of the IPCO V, Lecture Notes in Computer Science, Vol. 1084, Springer, Berlin, 1996, pp. 316\u2013329.","DOI":"10.1007\/3-540-61310-2_24"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB68","unstructured":"F. Sourd, Scheduling tasks on unrelated machines: large neighborhood improvement procedures, J. Heuristics, submitted for publication."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB69","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","article-title":"Parallel iterative search methods for vehicle routing problems","volume":"23","author":"Taillard","year":"1993","journal-title":"Network"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB70","unstructured":"E.D. Taillard, Heuristic methods for large centroid clustering problems, Technical Report IDSIA-96-96, Lugano, 1996."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB71","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","article-title":"Linear time computability of combinatorial problems on series-parallel graphs","volume":"29","author":"Takamizawa","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB72","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1287\/trsc.30.3.237","article-title":"Swapping applications in a daily airline fleet assignment","volume":"30","author":"Talluri","year":"1996","journal-title":"Transportation Sci."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB73","unstructured":"P.M. Thompson, Local search algorithms for vehicle routing and other combinatorial problems, Ph.D. Thesis, Operations Research Center, MIT, Cambridge, MA, 1988."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB74","unstructured":"P.M. Thompson, J.B. Orlin, The theory of cyclic transfers, Operations Research Center Working Paper, MIT, Cambridge MA, August 1989."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB75","doi-asserted-by":"crossref","DOI":"10.1287\/opre.41.5.935","article-title":"Cyclic transfer algorithms for multivehicle routing and scheduling problems","volume":"41","author":"Thompson","year":"1993","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB76","unstructured":"M. Yagiura, T. Ibaraki, F. Glover, An ejection chain approach for the generalized assignment problem, Technical Report #99013, Department of Applied Mathematics and Physics, Kyoto University, 1999."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB77","series-title":"Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization","first-page":"459","article-title":"A variable-depth search algorithm for the generalized assignment problem","author":"Yagiura","year":"1999"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB78","unstructured":"A. Yeo, Large exponential neighborhoods for the traveling salesman problem, Preprint no. 47, Department of Mathematics and Computer Science, Odense University, 1997."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB79","doi-asserted-by":"crossref","unstructured":"K. Wayne, A polynomial combinatorial algorithm for generalized minimum cost flow, STOC 1999.","DOI":"10.1145\/301250.301261"},{"key":"10.1016\/S0166-218X(01)00338-9_BIB80","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0166-218X(87)90031-X","article-title":"Steiner problem in Halin networks","volume":"17","author":"Winter","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00338-9_BIB81","series-title":"Meta-Heuristics: Theory and Applications","article-title":"Tabu search on the geometric traveling salesman problem","author":"Zachariasen","year":"1996"},{"key":"10.1016\/S0166-218X(01)00338-9_NEWBIB82","unstructured":"P.C. Gilmore, E.L. Lawler, D.B. Shmoys, Well-solved special cases, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem, Wiley, New York, 1985, pp. 87\u2013143."},{"key":"10.1016\/S0166-218X(01)00338-9_NEWBIB83","unstructured":"G.M. Gutin, On approach to solving the traveling salesman problem, in: Theory, Methodology, and Practice of System Research, Mathematical Methods of Systems Analysis, VNIIST, Moscow, 1984, pp. 184\u2013186."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003389?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003389?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T21:15:27Z","timestamp":1680988527000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01003389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":83,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0166218X01003389"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00338-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}