Login / Signup
Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances.
Benjamin Doerr
Marvin Künnemann
Published in:
Theor. Comput. Sci. (2015)
Keyphrases
</>
evolutionary algorithm
linear functions
optimization problems
upper bound
knapsack problem
simulated annealing
genetic algorithm
boolean functions
worst case
training data
special case
particle swarm optimization
branch and bound
target function