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