Towards a Lower Bound for the Average Case Runtime of Simulated Annealing on TSP.
Bodo MantheyJesse van RhijnPublished in: CoRR (2022)
Keyphrases
- average case
- lower bound
- simulated annealing
- worst case
- combinatorial optimization
- competitive ratio
- upper bound
- genetic algorithm
- traveling salesman problem
- optimal solution
- np hard
- vc dimension
- metaheuristic
- worst case analysis
- ant colony optimization
- branch and bound
- sample complexity
- evolutionary algorithm
- online algorithms
- tabu search
- average case complexity
- learning curves
- objective function
- uniform distribution
- lower and upper bounds
- search space
- approximation algorithms
- optimization problems
- sample complexity bounds
- knapsack problem
- linear programming relaxation
- feasible solution
- sample size
- covering numbers