Solving the Traveling Salesman Problem Using Efficient Randomized Parallel Approximation Algorithms.
Keqin LiPublished in: Parallel Algorithms Appl. (1997)
Keyphrases
- traveling salesman problem
- approximation algorithms
- combinatorial optimization
- randomized algorithms
- discrete optimization problems
- np hard
- special case
- optimization problems
- ant colony optimization
- worst case
- combinatorial problems
- hamiltonian cycle
- vertex cover
- minimum cost
- traveling salesman
- primal dual
- combinatorial optimization problems
- crossover operator
- vehicle routing problem
- exact algorithms
- valid inequalities
- approximation ratio
- transportation networks
- constant factor
- neural network
- discrete optimization
- branch and bound
- metaheuristic
- simulated annealing
- constant factor approximation