An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality.
Tobias MömkePublished in: Inf. Process. Lett. (2015)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- computational complexity
- cost function
- dynamic programming
- optimal solution
- np hard
- triangle inequality
- satisfy the triangle inequality
- particle swarm optimization
- optimization problems
- simulated annealing
- dimensionality reduction
- clustering method
- benchmark problems
- test problems
- search space