A new heuristic for the traveling salesman problem
RAIRO-Oper. Res., 24 3 (1990) 245-253
Published online: 2017-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Fine-grained Complexity Analysis of Two Classic TSP Variants
Mark de Berg, Kevin Buchin, Bart M. P. Jansen and Gerhard WoegingerACM Transactions on Algorithms 17 (1) 1 (2021)
https://doi.org/10.1145/3414845
(2011)
https://doi.org/10.1002/9780470400531.eorms0958
A new asymmetric pyramidally solvable class of the traveling salesman problem
Mohammed Fazle BakiOperations Research Letters 34 (6) 613 (2006)
https://doi.org/10.1016/j.orl.2005.12.001
Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration
Birger Funke, Tore Grünert and Stefan IrnichJournal of Heuristics 11 (4) 267 (2005)
https://doi.org/10.1007/s10732-005-1997-2
Integer Programming and Combinatorial Optimization
Agustin Bompadre and James B. OrlinLecture Notes in Computer Science, Integer Programming and Combinatorial Optimization 3509 437 (2005)
https://doi.org/10.1007/11496915_32
Dynamic Programming Methodologies in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem
Ozlem Ergun and James B. OrlinSSRN Electronic Journal (2003)
https://doi.org/10.2139/ssrn.489784
Upper bounds on ATSP neighborhood size
Gregory Gutin and Anders YeoDiscrete Applied Mathematics 129 (2-3) 533 (2003)
https://doi.org/10.1016/S0166-218X(03)00181-1
A survey of very large-scale neighborhood search techniques
Ravindra K. Ahuja, Özlem Ergun, James B. Orlin and Abraham P. PunnenDiscrete Applied Mathematics 123 (1-3) 75 (2002)
https://doi.org/10.1016/S0166-218X(01)00338-9
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
Gregory Gutin and Anders YeoDiscrete Applied Mathematics 119 (1-2) 107 (2002)
https://doi.org/10.1016/S0166-218X(01)00267-0
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
Richard K. Congram, Chris N. Potts and Steef L. van de VeldeINFORMS Journal on Computing 14 (1) 52 (2002)
https://doi.org/10.1287/ijoc.14.1.52.7712
TSP tour domination and Hamilton cycle decompositions of regular digraphs
Gregory Gutin and Anders YeoOperations Research Letters 28 (3) 107 (2001)
https://doi.org/10.1016/S0167-6377(01)00053-0
Construction heuristics for the asymmetric TSP
Fred Glover, Gregory Gutin, Anders Yeo and Alexey ZverovichEuropean Journal of Operational Research 129 (3) 555 (2001)
https://doi.org/10.1016/S0377-2217(99)00468-3
The traveling salesman problem: new polynomial approximation algorithms and domination analysis
Abraham P. PunnenJournal of Information and Optimization Sciences 22 (1) 191 (2001)
https://doi.org/10.1080/02522667.2001.10699482
Algorithm Engineering
Fred Glover, Gregory Gutin, Anders Yeo and Alexey ZverovichLecture Notes in Computer Science, Algorithm Engineering 1668 85 (1999)
https://doi.org/10.1007/3-540-48318-7_9
Integer Programming and Combinatorial Optimization
Rainer E. Burkard, Vladimir G. Deineko and Gerhard J. WoegingerLecture Notes in Computer Science, Integer Programming and Combinatorial Optimization 1084 490 (1996)
https://doi.org/10.1007/3-540-61310-2_36
Routing problems: A bibliography
Gilbert Laporte and Ibrahim H. OsmanAnnals of Operations Research 61 (1) 227 (1995)
https://doi.org/10.1007/BF02098290
The nitrate radical: Physics, chemistry, and the atmosphere
R.P Wayne, I Barnes, P Biggs, et al.Atmospheric Environment. Part A. General Topics 25 (1) 1 (1991)
https://doi.org/10.1016/0960-1686(91)90192-A