A note on approximation algorithms of the clustered traveling salesman problem.
Xiaoguang BaoZhaohui LiuWei YuGanggang LiPublished in: Inf. Process. Lett. (2017)
Keyphrases
- traveling salesman problem
- approximation algorithms
- np hard
- special case
- combinatorial optimization
- vertex cover
- optimization problems
- worst case
- ant colony optimization
- minimum cost
- primal dual
- combinatorial optimization problems
- combinatorial problems
- transportation networks
- vehicle routing problem
- exact algorithms
- hamiltonian cycle
- crossover operator
- traveling salesman
- constant factor approximation
- approximation ratio
- valid inequalities
- undirected graph
- evolutionary algorithm
- message passing