Traveling Salesman Problem
Author:
- 1 January 2008
- book chapter
- Published by Springer Nature
- p. 3935-3944
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequalityJournal of Discrete Algorithms, 2006
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphsJournal of the ACM, 2005
- TSP Heuristics: Domination Analysis and ComplexityAlgorithmica, 2003
- z-ApproximationsJournal of Algorithms, 2001
- Construction heuristics for the asymmetric TSPEuropean Journal of Operational Research, 2001
- Practical Performance of Efficient Minimum Cut AlgorithmsAlgorithmica, 2000
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- Transforming asymmetric into symmetric traveling salesman problemsOperations Research Letters, 1983
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960