A Fast Approximation Algorithm for TSP with Neighborhoods.
Joachim GudmundssonChristos LevcopoulosPublished in: Nord. J. Comput. (1999)
Keyphrases
- np hard
- optimal solution
- preprocessing
- search space
- detection algorithm
- high accuracy
- learning algorithm
- times faster
- closed form
- worst case
- approximation ratio
- theoretical analysis
- computational cost
- probabilistic model
- cost function
- significant improvement
- k means
- convex hull
- data sets
- experimental evaluation
- input data
- dynamic programming
- ant colony optimization
- monte carlo
- classification algorithm
- traveling salesman problem
- error bounds
- genetic algorithm