The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem.
Ulrich A. BrodowskyStefan HougardyPublished in: STACS (2021)
Keyphrases
- traveling salesman problem
- approximation ratio
- combinatorial optimization
- lin kernighan
- traveling salesman
- search algorithm
- approximation algorithms
- benchmark instances
- np hard
- neighborhood search
- variable neighborhood search
- special case
- greedy algorithms
- combinatorial optimization problems
- minimum spanning tree
- greedy algorithm
- optimization problems
- combinatorial problems
- ant colony optimization
- vehicle routing problem
- hamiltonian cycle
- ant colony optimization algorithm
- minimum cost
- exact algorithms
- valid inequalities
- path relinking
- optimal solution
- discrete optimization problems
- satisfy the triangle inequality
- dynamic programming
- simulated annealing
- branch and bound
- tabu search
- search procedure
- multi objective
- crossover operator
- constraint satisfaction
- scheduling problem
- aco algorithm
- cost function