An improved approximation algorithm for the clustered traveling salesman problem.
Xiaoguang BaoZhaohui LiuPublished in: Inf. Process. Lett. (2012)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- hamiltonian cycle
- dynamic programming
- discrete particle swarm optimization
- computational complexity
- expectation maximization
- traveling salesman
- cost function
- np hard
- optimization problems
- ant colony optimization algorithm
- minimum spanning tree
- metaheuristic
- combinatorial optimization problems
- benchmark problems
- neural network
- search space
- lower bound
- genetic algorithm