Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints

DOI10.1007/s00453-020-00739-xzbMath1443.68168OpenAlexW3045152478MaRDI QIDQ2006950

Timo Kötzing, Frank Neumann, Martin Schirneck, Tobias Friedrich, Feng Shi

Publication date: 12 October 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-020-00739-x

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints ⋮ 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

Cites Work

• Unnamed Item
• From black-box complexity to designing new genetic algorithms
• Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
• Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints

This page was built for publication: Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints