A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems.
Shoshana AnilyJulien BramelAlain HertzPublished in: Oper. Res. Lett. (1999)
Keyphrases
- traveling salesman
- benchmark problems
- test problems
- computational complexity
- lin kernighan
- shortest path problem
- optimization problems
- learning algorithm
- computational efficiency
- dynamic programming
- search space
- combinatorial optimization
- cost function
- simulated annealing
- particle swarm optimization
- np hard
- approximation algorithms
- worst case
- optimal path
- k means
- path finding
- exact algorithms
- minimum length
- approximation schemes
- linear programming