On the Complexity of Local Search for the Traveling Salesman Problem.
Christos H. PapadimitriouKenneth SteiglitzPublished in: SIAM J. Comput. (1977)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- neighborhood search
- lin kernighan
- combinatorial optimization problems
- ant colony optimization
- ant colony optimization algorithm
- metaheuristic
- traveling salesman
- optimization problems
- combinatorial problems
- valid inequalities
- vehicle routing problem
- transportation networks
- discrete particle swarm optimization
- hamiltonian cycle
- crossover operator
- path relinking
- genetic algorithm
- nature inspired
- genetic local search
- aco algorithm
- memetic algorithm
- tabu search
- search algorithm
- variable neighborhood search
- simulated annealing
- discrete optimization problems
- computational complexity
- particle swarm optimization
- subtour elimination