Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP.
Matthias EnglertHeiko RöglinBerthold VöckingPublished in: CoRR (2023)
Keyphrases
- worst case
- np hard
- dynamic programming
- high accuracy
- detection algorithm
- optimal solution
- traveling salesman problem
- experimental evaluation
- significant improvement
- cost function
- special case
- probabilistic model
- computational cost
- search space
- average case
- learning algorithm
- times faster
- matching algorithm
- segmentation algorithm
- particle swarm optimization
- error bounds
- improved algorithm
- space complexity
- running times
- combinatorial optimization
- complexity bounds
- data sets
- context free parsing
- ant colony optimization
- optimization algorithm
- theoretical analysis
- simulated annealing
- upper bound
- computational complexity
- reinforcement learning
- bayesian networks
- image sequences
- genetic algorithm