Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms

Abstract

Full Citation:

Simon Wietheger, Benjamin Doerr. Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. Parallel Problem Solving from Nature - PPSN XVIII - 18th International Conference, PPSN 2024, Hagenberg, Austria, September 14-18, 2024, Proceedings, Part IV (Michael Affenzeller and Stephan M. Winkler and Anna V. Kononova and Heike Trautmann and Tea Tusar and Penousal Machado and Thomas Bäck), volume 15151 of Lecture Notes in Computer Science, pages 153-168, 2024, Springer.

Simon Wietheger

Simon Wietheger is a Project Assistant at the Algorithms and Complexity Group.