Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, June 13, 2023, 12:15 pm

Duration: 45 minutes

Location: OAT S15/S16/S17

Speaker: Benjamin Doerr (Ecole Polytechnique)

Runtime Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)

The non-dominated sorting genetic algorithm II (NSGA-II), proposed by Deb et al. (Transactions on Evolutionary Computation, 2002) is the most intensively used multi-objective evolutionary algorithm in real-world applications (more than 50,000 citations on Google scholar). Only very recently, the first mathematical runtime analyses for this algorithm were conducted (Zheng, Liu, Doerr (AAAI 2022)). This work quickly triggered follow-up works at GECCO 2022, PPSN 2022, AAAI 2023, and IJCAI 2023. In this talk, I give an introduction to these recent works and point out some open problems.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login