Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract.
Matthias EnglertHeiko RöglinBerthold VöckingPublished in: SODA (2007)
Keyphrases
- worst case
- extended abstract
- np hard
- detection algorithm
- average case
- optimal solution
- search space
- learning algorithm
- matching algorithm
- probabilistic model
- optimization algorithm
- computational complexity
- theoretical analysis
- computationally efficient
- times faster
- preprocessing
- space complexity
- error bounds
- traveling salesman problem
- ant colony optimization
- genetic algorithm
- combinatorial optimization
- convex hull
- experimental evaluation
- knapsack problem
- recognition algorithm
- context free parsing
- belief networks
- tree structure
- generative model
- expectation maximization
- particle swarm optimization
- simulated annealing
- high accuracy
- dynamic programming
- cost function
- significant improvement
- lower bound
- data analysis
- objective function
- similarity measure