Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.
Nili Guttmann-BeckRefael HassinSamir KhullerBalaji RaghavachariPublished in: Algorithmica (2000)
Keyphrases
- traveling salesman problem
- approximation algorithms
- np hard
- approximation guarantees
- special case
- combinatorial optimization
- ant colony optimization
- worst case
- minimum cost
- vertex cover
- optimization problems
- constant factor
- combinatorial optimization problems
- combinatorial problems
- traveling salesman
- approximation ratio
- vehicle routing problem
- primal dual
- exact algorithms
- transportation networks
- neural network
- crossover operator
- hamiltonian cycle
- subtour elimination
- cost function