New parallel randomized algorithms for the traveling salesman problem.
Leyuan ShiSigurdur ÓlafssonNing SunPublished in: Comput. Oper. Res. (1999)
Keyphrases
- traveling salesman problem
- randomized algorithms
- combinatorial optimization
- ant colony optimization
- lower bound
- approximation algorithms
- hamiltonian cycle
- optimization problems
- randomized algorithm
- discrete optimization problems
- traveling salesman
- practical problems
- worst case
- objective function
- learning algorithm
- metaheuristic
- valid inequalities
- multi class
- upper bound
- optimal solution