ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2301.13687
  4. Cited By
Crossover Can Guarantee Exponential Speed-Ups in Evolutionary
  Multi-Objective Optimisation

Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation

31 January 2023
D. Dang
Andre Opris
Dirk Sudholt
ArXivPDFHTML

Papers citing "Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation"

9 / 9 papers shown
Title
A First Runtime Analysis of NSGA-III on a Many-Objective Multimodal Problem: Provable Exponential Speedup via Stochastic Population Update
A First Runtime Analysis of NSGA-III on a Many-Objective Multimodal Problem: Provable Exponential Speedup via Stochastic Population Update
Andre Opris
26
0
0
02 May 2025
Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
Benjamin Doerr
Martin S. Krejca
Andre Opris
26
0
0
02 May 2025
Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms
Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms
Chao Bian
Yawen Zhou
Mingxing Li
Chao Qian
13
33
0
05 Jun 2023
The First Proven Performance Guarantees for the Non-Dominated Sorting
  Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem
The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem
Sacha Cerf
Benjamin Doerr
Benjamin Hebras
Yakob Kahane
Simon Wietheger
40
32
0
22 May 2023
Lasting Diversity and Superior Runtime Guarantees for the $(μ+1)$
  Genetic Algorithm
Lasting Diversity and Superior Runtime Guarantees for the (μ+1)(μ+1)(μ+1) Genetic Algorithm
Benjamin Doerr
Aymen Echarghaoui
Mohammed Jamal
Martin S. Krejca
13
10
0
24 Feb 2023
The $(1+(λ,λ))$ Global SEMO Algorithm
The (1+(λ,λ))(1+(λ,λ))(1+(λ,λ)) Global SEMO Algorithm
Benjamin Doerr
O. Hadri
A. Pinard
32
8
0
07 Oct 2022
Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover
Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover
Benjamin Doerr
Zhongdi Qu
15
43
0
18 Aug 2022
Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm
  II (NSGA-II)
Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
Weijie Zheng
Benjamin Doerr
21
8
0
05 Mar 2022
Mathematical Runtime Analysis for the Non-Dominated Sorting Genetic
  Algorithm II (NSGA-II)
Mathematical Runtime Analysis for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
Weijie Zheng
Benjamin Doerr
24
39
0
16 Dec 2021
1