Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey.
Rainer E. BurkardVladimir G. DeinekoRené van DalJack A. A. van der VeenGerhard J. WoegingerPublished in: SIAM Rev. (1998)
Keyphrases
- traveling salesman problem
- special case
- combinatorial optimization
- optimization problems
- ant colony optimization
- np hard
- ant colony optimization algorithm
- combinatorial problems
- traveling salesman
- computational complexity
- discrete particle swarm optimization
- combinatorial optimization problems
- discrete optimization problems
- hamiltonian cycle
- transportation networks
- subtour elimination
- genetic local search
- nature inspired
- crossover operator
- valid inequalities
- np complete
- branch and bound
- metaheuristic
- evolutionary algorithm