{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T12:45:48Z","timestamp":1761741948528},"reference-count":30,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":[[1998,4]]},"DOI":"10.1016\/s0377-2217(97)00288-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"522-538","source":"Crossref","is-referenced-by-count":45,"title":["Relaxed tours and path ejections for the traveling salesman problem"],"prefix":"10.1016","volume":"106","author":[{"given":"C\u00e9sar","family":"Rego","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1962","series-title":"Theory of Graphs and its Applications","author":"Berge","key":"10.1016\/S0377-2217(97)00288-9_BIB1"},{"article-title":"Worst-case analysis of a new heuristic for the traveling salesman problem","year":"1976","author":"Christofides","key":"10.1016\/S0377-2217(97)00288-9_BIB2"},{"article-title":"Performance of various computers using standard linear equations software","year":"1997","author":"Dongarra","key":"10.1016\/S0377-2217(97)00288-9_BIB3"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB4","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 Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB5","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1090\/S0002-9904-1962-10791-5","article-title":"Covers and packings in family of sets","volume":"68","author":"Edmonds","year":"1962","journal-title":"Bulletin of the American Mathematical Society"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees, and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canadian Journal of Mathematics"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB7","first-page":"449","article-title":"New ejection chain and alternating path methods of traveling salesman problems","author":"Glover","year":"1992","journal-title":"Computer Science and Operations Research"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF00247211","article-title":"Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move","volume":"2","author":"Glover","year":"1996","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB9","doi-asserted-by":"crossref","first-page":"1209","DOI":"10.1287\/mnsc.24.12.1209","article-title":"Generalized networks: A fundamental computer based planning tool","volume":"24","author":"Glover","year":"1978","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01586932","article-title":"Solution of large-scale traveling salesman problems","volume":"51","author":"Gr\u00f6tschel","year":"1991","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB11","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(97)00288-9_BIB12","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"},{"article-title":"Ejection chain methods and tabu search for clustering","year":"1992","author":"Hubscher","key":"10.1016\/S0377-2217(97)00288-9_BIB13"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB14","series-title":"Computational complexity","article-title":"The Traveling Salesman Problem","author":"Johnson","year":"1985"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB15","series-title":"Proceedings of 17th International Colloqium on Automata Languages and Programming","first-page":"443","article-title":"Local search and the traveling salesman problem","author":"Johnson","year":"1990"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB16","article-title":"Near-optimal solutions to very large traveling salesman problems","author":"Johnson","year":"1996","journal-title":"Technical Report"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB17","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0377-2217(93)E0174-V","article-title":"Tabu search for multilevel generalized assignment problems","volume":"82","author":"Laguna","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","article-title":"The vehicle routing problem: An overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"European Journal of Operational Research"},{"year":"1985","series-title":"A Guided Tour of Combinatorial Optimization","author":"Lawler","key":"10.1016\/S0377-2217(97)00288-9_BIB19"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB20","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":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB21","first-page":"127","article-title":"A modified Lin-Kernighan traveling salesman heuristic","volume":"13","author":"Mak","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","article-title":"Optimization of a 532-city symmetric traveling salesman problem by branch-andcut","volume":"6","author":"Padberg","year":"1987","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1033004","article-title":"A branch-and-cut algorithm for the solution of large-scale traveling salesman problems","volume":"33","author":"Padberg","year":"1991","journal-title":"SIAM Review"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB24","first-page":"219","article-title":"Facet identification for the symetric traveling salesman problem","volume":"33","author":"Padberg","year":"1991","journal-title":"Mathematical Programming"},{"year":"1982","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","key":"10.1016\/S0377-2217(97)00288-9_BIB25"},{"article-title":"An efficient implementation of ejection chain procedures for the vehicle routing problem","year":"1994","author":"Rego","key":"10.1016\/S0377-2217(97)00288-9_BIB26"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB27","series-title":"Methaheuristics: Theory and Applications","article-title":"Parallel Tabu Search Algorithm based on Ejection Chains for the Vehicle Routing Problem","author":"Rego","year":"1996"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB28","first-page":"125","article-title":"TSPLIB \u2014 A Traveling Salesman Problem Library","volume":"17","author":"Reinelt","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB29","article-title":"The Traveling Salesman Problem, Computational Solutions for TSP Applications","volume":"vol. 840","author":"Reinelt","year":"1994"},{"key":"10.1016\/S0377-2217(97)00288-9_BIB30","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1287\/ijoc.8.2.134","article-title":"A fast composite heuristic for the symmetric traveling salesman problem","volume":"8","author":"Renaud","year":"1996","journal-title":"INFORMS Journal on Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002889?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002889?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T12:56:33Z","timestamp":1556369793000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002889"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":30,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221797002889"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00288-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"type":"print","value":"0377-2217"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}