Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms

Wietheger, Simon; Doerr, Benjamin

doi:10.1007/978-3-031-70085-9_10

by Simon Wietheger, Benjamin Doerr

Reference:

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

Bibtex Entry:

@string{springer="Springer Verlag"}
@inproceedings{WiethegerD24,
  author       = {Simon Wietheger and
                  Benjamin Doerr},
  editor       = {Michael Affenzeller and
                  Stephan M. Winkler and
                  Anna V. Kononova and
                  Heike Trautmann and
                  Tea Tusar and
                  Penousal Machado and
                  Thomas B{\"{a}}ck},
  title        = {Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms},
  booktitle    = {Parallel Problem Solving from Nature - {PPSN} {XVIII} - 18th International
                  Conference, {PPSN} 2024, Hagenberg, Austria, September 14-18, 2024,
                  Proceedings, Part {IV}},
  series       = {Lecture Notes in Computer Science},
  volume       = {15151},
  pages        = {153--168},
  publisher    = {Springer},
  year         = {2024},
  url          = {https://doi.org/10.1007/978-3-031-70085-9\_10},
  doi          = {10.1007/978-3-031-70085-9\_10},
  timestamp    = {Fri, 20 Sep 2024 14:01:13 +0200},
  biburl       = {https://dblp.org/rec/conf/ppsn/WiethegerD24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org},
  keywords = {ParAI}
}