Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.
Nili Guttmann-BeckRefael HassinSamir KhullerBalaji RaghavachariPublished in: FSTTCS (1998)
Keyphrases
- traveling salesman problem
- approximation algorithms
- approximation guarantees
- np hard
- combinatorial optimization
- special case
- ant colony optimization
- optimization problems
- primal dual
- hamiltonian cycle
- worst case
- minimum cost
- transportation networks
- combinatorial problems
- valid inequalities
- vehicle routing problem
- combinatorial optimization problems
- vertex cover
- traveling salesman
- exact algorithms
- crossover operator
- constant factor
- np complete
- undirected graph
- computational complexity
- genetic algorithm
- neural network