Skip to content

Author

Andre Opris

We have 3 of 38 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Book Open access Jul 2026

Hot of the Press: Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm

This work significantly enhance the understanding of the dynamics of the GSEMO, in particular, for the classic CountingOnesCountingZeros benchmark, and proves a lower bound of order Ω(n2 log n), for the first time matching the seminal upper bounds known for over twenty years.

Benjamin Doerr, Martin S. Krejca, Andre Opris · 0 citations
Book Open access Jul 2026

Hot of the Press: A First Runtime Analysis of NSGA-III on a Many-Objective Multimodal Problem: Provable Exponential Speedup via Stochastic Population Update

A rigorous runtime analysis of NSGA-III on the many-objective OneJumpZeroJump benchmark, providing runtime bounds where the number of objectives is constant and a stochastic population update provably guarantees a speedup of order Θ((k/b)k-1) in the runtime where b > 0 is a constant.

Andre Opris · 11 citations
Jul 2026

Provable Speedups From Dynamic Population Sizes in Evolutionary Algorithms for Multiobjective Optimization

This paper introduces the bi-objective problem class CLIMB and analyzes the runtime of GSEMO and the widely used NSGA-II on this problem, and proves that GSEMO and NSGA-II-DYN, a version of NSGA-II with dynamic population sizes, can find the Pareto front of CLIMB in expected fitness evaluations.

Andre Opris · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.