The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem.
Stefan HougardyFabian ZaiserXianghui ZhongPublished in: Oper. Res. Lett. (2020)
Keyphrases
- traveling salesman problem
- approximation ratio
- combinatorial optimization
- lin kernighan
- satisfy the triangle inequality
- search algorithm
- traveling salesman
- approximation algorithms
- benchmark instances
- variable neighborhood search
- np hard
- neighborhood search
- special case
- greedy algorithms
- greedy algorithm
- combinatorial problems
- minimum spanning tree
- optimization problems
- ant colony optimization
- ant colony optimization algorithm
- simulated annealing
- valid inequalities
- optimal solution
- crossover operator
- vehicle routing problem
- hamiltonian cycle
- beam search
- metaheuristic
- path relinking
- neural network
- tabu search
- genetic local search
- branch and bound algorithm
- metric space
- branch and bound
- constraint satisfaction
- distance function
- distance measure
- dynamic programming
- computational complexity