Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods.
Khaled M. ElbassioniAleksei V. FishkinRené SittersPublished in: Int. J. Comput. Geom. Appl. (2009)
Keyphrases
- traveling salesman problem
- approximation algorithms
- np hard
- ant colony optimization
- combinatorial optimization
- worst case
- special case
- minimum cost
- vertex cover
- combinatorial problems
- optimization problems
- combinatorial optimization problems
- exact algorithms
- continuous variables
- hamiltonian cycle
- traveling salesman
- approximation ratio
- crossover operator
- transportation networks
- valid inequalities
- primal dual
- vehicle routing problem
- euclidean distance
- column generation
- constant factor
- finite number
- subtour elimination