Approximation algorithms for TSP with neighborhoods in the plane.
Adrian DumitrescuJoseph S. B. MitchellPublished in: CoRR (2017)
Keyphrases
- simulated annealing
- approximation algorithms
- combinatorial optimization
- np hard
- genetic algorithm
- traveling salesman problem
- metaheuristic
- tabu search
- ant colony optimization
- special case
- minimum cost
- vertex cover
- solution space
- primal dual
- approximation ratio
- facility location problem
- network design problem
- np hardness
- set cover
- optimal solution
- search space
- approximation schemes
- worst case
- constant factor
- disjoint paths
- undirected graph
- precedence constraints
- lower bound
- constraint satisfaction problems
- linear programming
- scheduling problem
- polynomial time approximation
- open shop