The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5.
Sophia HeimannHung P. HoangStefan HougardyPublished in: ICALP (2024)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- hamiltonian cycle
- computational complexity
- cost function
- ant colony optimization algorithm
- minimum spanning tree
- optimal solution
- np hard
- simulated annealing
- objective function
- discrete particle swarm optimization
- traveling salesman
- dynamic programming
- energy function
- metaheuristic
- expectation maximization
- particle swarm optimization
- similarity measure