Average-case approximation ratio of the 2-opt algorithm for the TSP.
Christian EngelsBodo MantheyPublished in: Oper. Res. Lett. (2009)
Keyphrases
- average case
- approximation ratio
- worst case
- np hard
- dynamic programming
- search space
- worst case analysis
- competitive ratio
- approximation algorithms
- greedy algorithm
- computational complexity
- special case
- theoretical analysis
- optimal solution
- learning algorithm
- learning curves
- lower bound
- simulated annealing
- traveling salesman problem
- objective function
- mixed integer programming
- training data
- machine learning