Lower bounds for the runtime of a global multi-objective evolutionary algorithm.
Benjamin DoerrBojana KodricMarco VoigtPublished in: IEEE Congress on Evolutionary Computation (2013)
Keyphrases
- lower bound
- multi objective evolutionary algorithms
- upper bound
- multi objective
- benchmark test
- branch and bound
- objective function
- multi objective optimization
- multi objective evolutionary
- bi objective
- optimal solution
- worst case
- np hard
- knapsack problem
- mathematical model
- test problems
- nsga ii
- expert systems
- search algorithm