The k-Opt algorithm for the Traveling Salesman Problem has exponential running time for k≥5.
Sophia HeimannHung P. HoangStefan HougardyPublished in: CoRR (2024)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- hamiltonian cycle
- dynamic programming
- discrete particle swarm optimization
- optimization problems
- computational complexity
- convex hull
- simulated annealing
- optimization algorithm
- np hard
- traveling salesman
- metaheuristic
- expectation maximization
- cost function
- knapsack problem
- dissimilarity measure
- minimum spanning tree
- ant colony optimization algorithm
- multi objective
- neural network
- subtour elimination