On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric TSP.
Xianghui ZhongPublished in: CoRR (2019)
Keyphrases
- approximation ratio
- np hard
- traveling salesman problem
- learning algorithm
- cost function
- lin kernighan
- ant colony optimization
- optimal solution
- computational complexity
- search space
- traveling salesman
- expectation maximization
- detection algorithm
- approximation algorithms
- genetic algorithm
- greedy algorithm
- distance metric
- linear programming
- worst case
- combinatorial optimization
- distance function
- metric space
- benchmark problems
- exact algorithms
- dynamic programming
- special case