Domination analysis of some heuristics for the traveling salesman problem
- 15 June 2002
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 119 (1-2) , 117-128
- https://doi.org/10.1016/s0166-218x(01)00268-2
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination numberDiscrete Applied Mathematics, 2002
- Exponential neighbourhood local search for the traveling salesman problemComputers & Operations Research, 1999
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithmsJournal of the Operational Research Society, 1997
- Local search and the local structure of NP-complete problemsOperations Research Letters, 1992
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1964