Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
From MaRDI portal
Publication:2006950
Cites work
- Analysis of the (1+1) EA on subclasses of linear functions under uniform and linear constraints
- Analyzing randomized search heuristics: tools from probability theory
- From black-box complexity to designing new genetic algorithms
- Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
Cited in
(6)- Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
- Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints
- Corrigendum to: ``Differential evolution algorithm with separated groups for multi-dimensional optimization problems [Eur. J. Oper. Res. 216 (2012) 33-46]
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
- Corrigendum to: ``A heuristic and evolutionary algorithm to optimize the coefficients of curve parametrizations.
This page was built for publication: Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2006950)