The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem.
Ulrich A. BrodowskyStefan HougardyXianghui ZhongPublished in: CoRR (2021)
Keyphrases
- traveling salesman problem
- approximation ratio
- combinatorial optimization
- lin kernighan
- traveling salesman
- search algorithm
- approximation algorithms
- benchmark instances
- variable neighborhood search
- neighborhood search
- greedy algorithm
- np hard
- special case
- ant colony optimization
- greedy algorithms
- combinatorial optimization problems
- exact algorithms
- ant colony optimization algorithm
- optimization problems
- minimum spanning tree
- combinatorial problems
- vehicle routing problem
- path relinking
- discrete optimization problems
- satisfy the triangle inequality
- optimal solution
- crossover operator
- genetic local search
- minimum cost
- euclidean distance
- hamiltonian cycle
- simulated annealing
- beam search
- valid inequalities
- branch and bound
- tabu search
- metaheuristic
- dynamic programming
- objective function
- lagrangian relaxation
- worst case