On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP.
Xianghui ZhongPublished in: ESA (2020)
Keyphrases
- approximation ratio
- np hard
- traveling salesman problem
- graph structure
- graph based algorithm
- search space
- neural network
- dynamic programming
- worst case
- lin kernighan
- approximation algorithms
- special case
- learning algorithm
- optimal solution
- ant colony optimization
- distance metric
- k means
- computational complexity
- search algorithm
- objective function
- cost function
- computational efficiency
- directed graph
- parameter settings