Updates are available Correction dated 2020-07-20
Click to view Correction: https://doi.org/10.1007/s00453-020-00739-x
-
Authors
Shi, Feng https://orcid.org/0000-0002-1415-0515
Schirneck, Martin
Friedrich, Tobias
Kötzing, Timo
Neumann, Frank
-
Funding
Funding for this research was provided by:
German Research Foundation (FR2988(TOSU))
Australian Research Council (DP140103400, DP160102401)
- License Information
-
More Information
Article History
Received: 31 August 2017
Accepted: 3 May 2018
First Online: 10 May 2018
Change Date: 20 July 2020
Change Type: Correction
Change Details: In the article <i>Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints</i>, we claimed a worst-case runtime of and for the Multi-Objective Evolutionary Algorithm and the Multi-Objective Genetic Algorithm, respectively, on linear profit functions under dynamic uniform constraint, where denotes the difference between the original constraint bound <i>B</i> and the new one. The technique used to prove these results contained an error. We correct this mistake and show a weaker bound of for both algorithms instead.
