Exponential upper bounds for the runtime of randomized search heuristics.
Benjamin DoerrPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- search heuristics
- upper bound
- lower bound
- constraint programming
- beam search
- tabu search
- branch and bound
- evolutionary algorithm
- search strategy
- search algorithm
- genetic algorithm
- lower and upper bounds
- branch and bound algorithm
- upper and lower bounds
- worst case
- search strategies
- knapsack problem
- branch and bound search
- metaheuristic
- constraint satisfaction problems
- markov chain
- simulated annealing
- multi objective
- learning algorithm