On the Approximation Ratio of the 3-Opt Algorithm for the (1, 2)-TSP.
Xianghui ZhongPublished in: CoRR (2021)
Keyphrases
- approximation ratio
- np hard
- high accuracy
- optimal solution
- improved algorithm
- computational complexity
- preprocessing
- simulated annealing
- computational cost
- traveling salesman problem
- detection algorithm
- experimental evaluation
- genetic algorithm
- probabilistic model
- worst case
- search space
- dynamic programming
- clustering method
- objective function
- expectation maximization
- clustering algorithm
- image sequences
- greedy algorithm
- similarity measure
- optimization algorithm
- theoretical analysis
- particle swarm optimization
- special case
- cost function