On the approximation ratio of the 3-Opt algorithm for the (1, 2)-TSP.
Xianghui ZhongPublished in: Oper. Res. Lett. (2021)
Keyphrases
- approximation ratio
- dynamic programming
- np hard
- expectation maximization
- recognition algorithm
- simulated annealing
- k means
- ant colony optimization
- learning algorithm
- improved algorithm
- approximation algorithms
- traveling salesman problem
- times faster
- matching algorithm
- detection algorithm
- segmentation algorithm
- computational complexity
- preprocessing
- optimization algorithm
- classification algorithm
- high accuracy
- data sets
- search space
- tree structure
- worst case
- similarity measure
- cost function
- particle swarm optimization
- objective function
- combinatorial optimization
- knapsack problem