Approximation algorithms for the Traveling Salesman Problem with range condition.
D. Arun KumarC. Pandu RanganPublished in: RAIRO Theor. Informatics Appl. (2000)
Keyphrases
- traveling salesman problem
- approximation algorithms
- np hard
- ant colony optimization
- combinatorial optimization
- special case
- worst case
- optimization problems
- vertex cover
- combinatorial problems
- minimum cost
- traveling salesman
- primal dual
- combinatorial optimization problems
- exact algorithms
- hamiltonian cycle
- crossover operator
- transportation networks
- approximation ratio
- vehicle routing problem
- randomized algorithms
- simulated annealing
- valid inequalities
- branch and bound algorithm
- search space
- computational complexity