An Empirical Analysis of Approximation Algorithms for the Euclidean Traveling Salesman Problem.
Yihui HeMing XiangPublished in: CoRR (2017)
Keyphrases
- traveling salesman problem
- approximation algorithms
- np hard
- combinatorial optimization
- worst case
- special case
- ant colony optimization
- vertex cover
- optimization problems
- combinatorial problems
- exact algorithms
- combinatorial optimization problems
- crossover operator
- minimum cost
- transportation networks
- euclidean distance
- constant factor
- hamiltonian cycle
- undirected graph
- primal dual
- approximation ratio
- traveling salesman
- similarity measure
- valid inequalities
- finite number
- vehicle routing problem
- branch and bound
- metaheuristic
- constant factor approximation