The Approximation Ratio of the 2-Opt Heuristic for the Metric Traveling Salesman Problem.
Stefan HougardyFabian ZaiserXianghui ZhongPublished in: CoRR (2019)
Keyphrases
- traveling salesman problem
- approximation ratio
- combinatorial optimization
- lin kernighan
- satisfy the triangle inequality
- traveling salesman
- search algorithm
- approximation algorithms
- benchmark instances
- variable neighborhood search
- neighborhood search
- np hard
- ant colony optimization
- optimization problems
- special case
- combinatorial problems
- greedy algorithm
- minimum spanning tree
- greedy algorithms
- ant colony optimization algorithm
- path relinking
- vehicle routing problem
- valid inequalities
- genetic local search
- hamiltonian cycle
- crossover operator
- dynamic programming
- minimum cost
- metaheuristic
- discrete optimization problems
- objective function
- branch and bound algorithm
- metric space
- tabu search
- simulated annealing
- optimal solution
- constraint satisfaction problems
- multi objective
- evolutionary algorithm
- search space