On the Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSP.
Marvin KünnemannBodo MantheyPublished in: CTW (2015)
Keyphrases
- approximation ratio
- traveling salesman problem
- np hard
- travelling salesman
- combinatorial optimization
- search algorithm
- approximation algorithms
- optimal solution
- special case
- traveling salesman
- greedy algorithm
- greedy heuristic
- greedy algorithms
- heuristic solution
- search space
- simulated annealing
- exact algorithms
- minimum cost
- tabu search
- metaheuristic
- approximately optimal
- optimization problems
- lower bound
- scheduling problem
- worst case
- ant colony optimization
- valid inequalities
- approximation guarantees
- branch and bound
- bin packing
- heuristic function
- search strategies
- feasible solution
- data sets
- objective function
- genetic algorithm