{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:41:21Z","timestamp":1759840881183,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":310,"publisher":"ACM","funder":[{"name":"FMJH Program PGMO"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,14]]},"DOI":"10.1145\/3712255.3716526","type":"proceedings-article","created":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T15:23:44Z","timestamp":1754925824000},"page":"1042-1069","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Tutorial: A Gentle Introduction to Theory (for Non-Theoreticians)"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5283-4208","authenticated-orcid":false,"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"Ecole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.04.008"},{"key":"e_1_3_2_1_2_1","volume-title":"PPSN 2020","author":"Antipov Denis","year":"2020","unstructured":"[ABD20] Denis Antipov, Maxim Buzdalov, and Benjamin Doerr. First steps towards a runtime analysis when starting with a good solution. In Parallel Problem Solving From Nature, PPSN 2020, Part II, pages 560\u2013573. Springer, 2020."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-00957-5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-023-01098-z"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1996312"},{"key":"e_1_3_2_1_6_1","volume-title":"PPSN 2020","author":"Antipov Denis","year":"2020","unstructured":"[AD20] Denis Antipov and Benjamin Doerr. Runtime analysis of a heavy-tailed (1 + (\u03bb, \u03bb)) genetic algorithm on jump functions. In Parallel Problem Solving From Nature, PPSN 2020, Part II, pages 545\u2013559. Springer, 2020."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00731-5"},{"key":"e_1_3_2_1_8_1","first-page":"1466","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Antipov Denis","year":"2018","unstructured":"[ADFH18] Denis Antipov, Benjamin Doerr, Jiefeng Fang, and Tangi Hetet. Runtime analysis for the (\u03bc + \u03bb) EA optimizing OneMax. In Genetic and Evolutionary Computation Conference, GECCO 2018, pages 1459\u20131466. ACM, 2018."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654196"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340317"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00907-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2025\/982"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321838"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900602"},{"key":"e_1_3_2_1_15_1","first-page":"8","volume-title":"International Conference on Genetic Algorithms, ICGA","author":"B\u00e4ck Thomas","year":"1993","unstructured":"[B\u00e4c93] Thomas B\u00e4ck. Optimal mutation rates in genetic search. In International Conference on Genetic Algorithms, ICGA 1993, pages 2\u20138. Morgan Kaufmann, 1993."},{"key":"e_1_3_2_1_16_1","volume-title":"Evolutionary Programming, Genetic Algorithms","author":"B\u00e4ck Thomas","year":"1996","unstructured":"[B\u00e4c96] Thomas B\u00e4ck. Evolutionary Algorithms in Theory and Practice - Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press, 1996."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319619.3322067"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377929.3398148"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1527125.1527134"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459350"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-00977-1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071297"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390184"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590523"},{"key":"e_1_3_2_1_25_1","first-page":"10","volume-title":"PPSN","author":"B\u00f6ttcher S\u00fcntje","year":"2010","unstructured":"[BDN10] S\u00fcntje B\u00f6ttcher, Benjamin Doerr, and Frank Neumann. Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In Parallel Problem Solving from Nature, PPSN 2010, pages 1\u201310. Springer, 2010."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/548530"},{"key":"e_1_3_2_1_27_1","first-page":"660","volume-title":"PPSN","author":"Brockhoff Dimo","year":"2008","unstructured":"[BFN08] Dimo Brockhoff, Tobias Friedrich, and Frank Neumann. Analyzing hypervolume indicator based algorithms. In Parallel Problem Solving from Nature, PPSN 2008, pages 651\u2013660. Springer, 2008."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5726"},{"key":"e_1_3_2_1_29_1","first-page":"901","volume-title":"PPSN","author":"Badkobeh Golnaz","year":"2014","unstructured":"[BLS14] Golnaz Badkobeh, Per Kristian Lehre, and Dirk Sudholt. Unbiased black-box complexity of parallel search. In Parallel Problem Solving from Nature, PPSN 2014, pages 892\u2013901. Springer, 2014."},{"key":"e_1_3_2_1_30_1","first-page":"441","volume-title":"PPSN","author":"Bian Chao","year":"2022","unstructured":"[BQ22] Chao Bian and Chao Qian. Better running time of the non-dominated sorting genetic algorithm II (NSGA-II) by using stochastic tournament selection. In Parallel Problem Solving From Nature, PPSN 2022, pages 428\u2013441. Springer, 2022."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/195"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340311"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/612"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2753538"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/613"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.2985450"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00147"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2745715"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00743-1"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/171"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/229"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205591"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754684"},{"key":"e_1_3_2_1_44_1","first-page":"1430","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Doerr Benjamin","year":"2015","unstructured":"[DD15b] Benjamin Doerr and Carola Doerr. A tight runtime analysis of the (1 + (\u03bb, \u03bb)) genetic algorithm on OneMax. In Genetic and Evolutionary Computation Conference, GECCO 2015, pages 1423\u20131430. ACM, 2015."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0354-9"},{"key":"e_1_3_2_1_46_1","first-page":"321","volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"Doerr Benjamin","unstructured":"[DD20] Benjamin Doerr and Carola Doerr. Theory of parameter control for discrete black-box optimization: provable performance gains through dynamic parameter choices. In Benjamin Doerr and Frank Neumann, editors, Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pages 271\u2013321. Springer, 2020. Also available at https:\/\/arxiv.org\/abs\/1804.05650."},{"key":"e_1_3_2_1_47_1","volume-title":"PPSN 2022","author":"Doerr Benjamin","year":"2022","unstructured":"[DD22] Benjamin Doerr and Marc Dufay. General univariate estimation-of-distribution algorithms. In Parallel Problem Solving From Nature, PPSN 2022, Part II, pages 470\u2013484. Springer, 2022."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463480"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/616"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598341"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.07.009"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071233"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0341-1"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00854-3"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590509"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321731"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5504"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987372"},{"key":"e_1_3_2_1_60_1","first-page":"834","volume-title":"PPSN","author":"Doerr Benjamin","year":"2016","unstructured":"[DDY16] Benjamin Doerr, Carola Doerr, and Jing Yang. k-bit mutation with self-adjusting k outperforms standard bit mutation. In Parallel Problem Solving from Nature, PPSN 2016, pages 824\u2013834. Springer, 2016."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.06.014"},{"key":"e_1_3_2_1_62_1","first-page":"20691","volume-title":"Conference on Artificial Intelligence, AAAI","author":"Doerr Benjamin","year":"2024","unstructured":"[DEJK24] Benjamin Doerr, Aymen Echarghaoui, Mohammed Jamal, and Martin S. Krejca. Runtime analysis of the (\u03bc + 1) GA: provable speed-ups from strong drift towards diverse populations. In Conference on Artificial Intelligence, AAAI 2024, pages 20683\u201320691. AAAI Press, 2024."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908956"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2724201"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-023-01146-8"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908827"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0502-x"},{"key":"e_1_3_2_1_68_1","first-page":"1895","volume-title":"Congress on Evolutionary Computation, CEC","author":"Doerr Benjamin","year":"2007","unstructured":"[DHK07] Benjamin Doerr, Edda Happ, and Christian Klein. A tight bound for the (1 + 1)-EA for the single source shortest path problem. In Congress on Evolutionary Computation, CEC 2007, pages 1890\u20131895. IEEE, 2007."},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.10.035"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330167"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2007.15.4.401"},{"key":"e_1_3_2_1_72_1","first-page":"528","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Doerr Benjamin","year":"2022","unstructured":"[DHP22] Benjamin Doerr, Omar El Hadri, and Adrien Pinard. The (1+(\u03bb, \u03bb)) global SEMO algorithm. In Genetic and Evolutionary Computation Conference, GECCO 2022, pages 520\u2013528. ACM, 2022."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i25.34902"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277192"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830618"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967669"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.10.059"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0187-y"},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00055"},{"key":"e_1_3_2_1_80_1","first-page":"22","volume-title":"PPSN","author":"Droste Stefan","year":"1998","unstructured":"[DJW98a] Stefan Droste, Thomas Jansen, and Ingo Wegener. On the optimization of unimodal functions with the (1 + 1) evolutionary algorithm. In Parallel Problem Solving from Nature, PPSN 1998, pages 13\u201322. Springer, 1998."},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.700079"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830748"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463565"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.03.015"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390177"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2956633"},{"key":"e_1_3_2_1_89_1","first-page":"66","volume-title":"EvoCOP","author":"Doerr Benjamin","year":"2020","unstructured":"[DK20c] Benjamin Doerr and Martin S. Krejca. The univariate marginal distribution algorithm copes well with deception and epistasis. In Evolutionary Computation in Combinatorial Optimization, EvoCOP 2020, pages 51\u201366. Springer, 2020."},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459352"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00775-7"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.11.028"},{"key":"e_1_3_2_1_93_1","volume-title":"Difficulties of the NSGA-II with the many-objective LeadingOnes problem. CoRR, abs\/2411.10017","author":"Doerr Benjamin","year":"2024","unstructured":"[DKK24] Benjamin Doerr, Dimitri Korkotashvili, and Martin S. Krejca. Difficulties of the NSGA-II with the many-objective LeadingOnes problem. CoRR, abs\/2411.10017, 2024."},{"key":"e_1_3_2_1_94_1","first-page":"250","volume-title":"FOCI","author":"Doerr Benjamin","year":"2007","unstructured":"[DKS07] Benjamin Doerr, Christian Klein, and Tobias Storch. Faster evolutionary algorithms by superior graph representation. In Foundations of Computational Intelligence, FOCI 2007, pages 245\u2013250. IEEE, 2007."},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654140"},{"key":"e_1_3_2_1_96_1","volume-title":"PPSN 2024","author":"Doerr Benjamin","year":"2024","unstructured":"[DKW24] Benjamin Doerr, Martin S. Krejca, and No\u00e9 Weeks. Proven runtime guarantees for how the MOEA\/D computes the Pareto front from the subproblem solutions. In Parallel Problem Solving from Nature, PPSN 2024, Part III, pages 197\u2013212. Springer, 2024."},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754814"},{"key":"e_1_3_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0103-x"},{"key":"e_1_3_2_1_99_1","first-page":"813","volume-title":"PPSN","author":"Dang Duc-Cuong","year":"2016","unstructured":"[DL16b] Duc-Cuong Dang and Per Kristian Lehre. Self-adaptation of mutation rates in non-elitist populations. In Parallel Problem Solving from Nature, PPSN 2016, pages 803\u2013813. Springer, 2016."},{"key":"e_1_3_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"e_1_3_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0507-5"},{"key":"e_1_3_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205611"},{"key":"e_1_3_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4"},{"key":"e_1_3_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205563"},{"key":"e_1_3_2_1_105_1","first-page":"36448","volume-title":"NeurIPS 2023","author":"Do Anh Viet","year":"2023","unstructured":"[DNNS23] Anh Viet Do, Aneta Neumann, Frank Neumann, and Andrew M. Sutton. Rigorous runtime analysis of MOEA\/D for solving multi-objective minimum weight base problems. In Advances in Neural Information Processing Systems, NeurIPS 2023, pages 36434\u201336448, 2023."},{"key":"e_1_3_2_1_106_1","first-page":"1114","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Doerr Benjamin","year":"2016","unstructured":"[Doe16] Benjamin Doerr. Optimal parameter settings for the (1 + (\u03bb, \u03bb)) genetic algorithm. In Genetic and Evolutionary Computation Conference, GECCO 2016, pages 1107\u20131114. ACM, 2016."},{"key":"e_1_3_2_1_107_1","volume-title":"PPSN 2020","author":"Doerr Benjamin","year":"2020","unstructured":"[Doe20] Benjamin Doerr. Lower bounds for non-elitist evolutionary algorithms via negative multiplicative drift. In Parallel Problem Solving From Nature, PPSN 2020, Part II, pages 604\u2013618. Springer, 2020."},{"key":"e_1_3_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.09.032"},{"key":"e_1_3_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00780-w"},{"key":"e_1_3_2_1_110_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00896-7"},{"key":"e_1_3_2_1_111_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590421"},{"key":"e_1_3_2_1_112_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26460"},{"key":"e_1_3_2_1_113_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_3_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754760"},{"key":"e_1_3_2_1_115_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3250552"},{"key":"e_1_3_2_1_116_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26462"},{"key":"e_1_3_2_1_117_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26461"},{"key":"e_1_3_2_1_118_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.12.020"},{"key":"e_1_3_2_1_119_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1006209"},{"key":"e_1_3_2_1_120_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45105-6_103"},{"key":"e_1_3_2_1_121_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24854-5_107"},{"key":"e_1_3_2_1_122_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-006-9001-0"},{"key":"e_1_3_2_1_123_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321837"},{"key":"e_1_3_2_1_124_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460245"},{"key":"e_1_3_2_1_125_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1569937"},{"key":"e_1_3_2_1_126_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.10.004"},{"key":"e_1_3_2_1_127_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330345"},{"key":"e_1_3_2_1_128_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9684-9"},{"key":"e_1_3_2_1_129_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00726-2"},{"key":"e_1_3_2_1_130_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390163"},{"key":"e_1_3_2_1_131_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.2987361"},{"key":"e_1_3_2_1_132_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449726.3462719"},{"key":"e_1_3_2_1_133_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2025\/986"},{"key":"e_1_3_2_1_134_1","first-page":"12","volume-title":"PPSN","author":"Eiben A. E.","year":"1990","unstructured":"[EAvH90] A. E. Eiben, Emile H. L. Aarts, and Kees M. van Hee. Global convergence of genetic algorithms: A markov chain analysis. In Parallel Problem Solving from Nature, PPSN 1990, pages 4\u201312. Springer, 1990."},{"key":"e_1_3_2_1_135_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.05.021"},{"key":"e_1_3_2_1_136_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771166"},{"key":"e_1_3_2_1_137_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012272"},{"key":"e_1_3_2_1_138_1","volume-title":"PPSN 2018","author":"Friedrich Tobias","year":"2018","unstructured":"[FGQW18] Tobias Friedrich, Andreas G\u00f6bel, Francesco Quinzan, and Markus Wagner. Heavy-tailed mutation operators in single-objective combinatorial optimization. In Parallel Problem Solving from Nature, PPSN 2018, Part I, pages 134\u2013145. Springer, 2018."},{"key":"e_1_3_2_1_139_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2009.17.1.3"},{"key":"e_1_3_2_1_140_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277194"},{"key":"e_1_3_2_1_141_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.08.021"},{"key":"e_1_3_2_1_142_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460246"},{"key":"e_1_3_2_1_143_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908895"},{"key":"e_1_3_2_1_144_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2613739"},{"key":"e_1_3_2_1_145_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528713"},{"key":"e_1_3_2_1_146_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00159"},{"key":"e_1_3_2_1_147_1","doi-asserted-by":"publisher","DOI":"10.1109\/72.265956"},{"key":"e_1_3_2_1_148_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205515"},{"key":"e_1_3_2_1_149_1","first-page":"1124","volume-title":"GECCO","author":"Fischer Simon","year":"2004","unstructured":"[FW04] Simon Fischer and Ingo Wegener. The Ising model on the ring: mutation versus recombination. In Genetic and Evolutionary Computation, GECCO 2004, pages 1113\u20131124. Springer, 2004."},{"key":"e_1_3_2_1_150_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.04.002"},{"key":"e_1_3_2_1_151_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0429-2"},{"key":"e_1_3_2_1_152_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299908"},{"key":"e_1_3_2_1_153_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0072-0"},{"key":"e_1_3_2_1_154_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.2.173"},{"key":"e_1_3_2_1_155_1","doi-asserted-by":"publisher","DOI":"10.5555\/534133"},{"key":"e_1_3_2_1_156_1","first-page":"792","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Brian","year":"2014","unstructured":"[GP14] Brian W. Goldman and William F. Punch. Parameter-less population pyramid. In Genetic and Evolutionary Computation Conference, GECCO 2014, pages 785\u2013792. ACM, 2014."},{"key":"e_1_3_2_1_157_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36494-3_37"},{"key":"e_1_3_2_1_158_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0214-z"},{"key":"e_1_3_2_1_159_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0360-y"},{"key":"e_1_3_2_1_160_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00262-8"},{"key":"e_1_3_2_1_161_1","first-page":"71","volume-title":"PPSN","author":"Hansen Nikolaus","year":"2006","unstructured":"[HGAK06] Nikolaus Hansen, Fabian Gemperle, Anne Auger, and Petros Koumoutsakos. When do heavy-tail distributions help? In Parallel Problem Solving from Nature, PPSN 2006, pages 62\u201371. Springer, 2006."},{"key":"e_1_3_2_1_162_1","first-page":"158","volume-title":"PPSN","author":"Horn Jeffrey","year":"1994","unstructured":"[HGD94] Jeffrey Horn, David E. Goldberg, and Kalyanmoy Deb. Long path problems. In Parallel Problem Solving from Nature, PPSN 1994, pages 149\u2013158. Springer, 1994."},{"key":"e_1_3_2_1_163_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389277"},{"key":"e_1_3_2_1_164_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797971"},{"key":"e_1_3_2_1_165_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205608"},{"key":"e_1_3_2_1_166_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450218.3477306"},{"key":"e_1_3_2_1_167_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459338"},{"key":"e_1_3_2_1_168_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564755"},{"key":"e_1_3_2_1_169_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00058-3"},{"key":"e_1_3_2_1_170_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5615"},{"key":"e_1_3_2_1_171_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2930979"},{"key":"e_1_3_2_1_172_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012296"},{"key":"e_1_3_2_1_173_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/232"},{"key":"e_1_3_2_1_174_1","first-page":"51","volume-title":"PPSN","author":"J\u00e4gersk\u00fcpper Jens","year":"2008","unstructured":"[J\u00e4g08] Jens J\u00e4gersk\u00fcpper. A blend of Markov-chain and drift analysis. In Parallel Problem Solving From Nature, PPSN 2008, pages 41\u201351. Springer, 2008."},{"key":"e_1_3_2_1_175_1","first-page":"69","volume-title":"FOGA","author":"Jansen Thomas","year":"2007","unstructured":"[Jan07] Thomas Jansen. On the brittleness of evolutionary algorithms. In Foundations of Genetic Algorithms, FOGA 2007, pages 54\u201369. Springer, 2007."},{"key":"e_1_3_2_1_176_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17339-4"},{"key":"e_1_3_2_1_177_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666921"},{"key":"e_1_3_2_1_178_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460248"},{"key":"e_1_3_2_1_179_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068152"},{"key":"e_1_3_2_1_180_1","first-page":"32","volume-title":"FOCI","author":"J\u00e4gersk\u00fcpper Jens","year":"2007","unstructured":"[JS07] Jens J\u00e4gersk\u00fcpper and Tobias Storch. When the plus strategy outperforms the comma strategy and when not. In Foundations of Computational Intelligence, FOCI 2007, pages 25\u201332. IEEE, 2007."},{"key":"e_1_3_2_1_181_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48481-7_17"},{"key":"e_1_3_2_1_182_1","first-page":"98","volume-title":"PPSN","author":"Jansen Thomas","year":"2000","unstructured":"[JW00] Thomas Jansen and Ingo Wegener. On the choice of the mutation probability for the (1+1) EA. In Parallel Problem Solving from Nature, PPSN 2000, pages 89\u201398. Springer, 2000."},{"key":"e_1_3_2_1_183_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0940-2"},{"key":"e_1_3_2_1_184_1","doi-asserted-by":"publisher","DOI":"10.5555\/1099040.1704883"},{"key":"e_1_3_2_1_185_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.01.002"},{"key":"e_1_3_2_1_186_1","first-page":"1332","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Jansen Thomas","year":"2012","unstructured":"[JZ12] Thomas Jansen and Christine Zarges. Fixed budget computations: a different perspective on run time analysis. In Terence Soule and Jason H. Moore, editors, Genetic and Evolutionary Computation Conference, GECCO 2012, pages 1325\u20131332. ACM, 2012."},{"key":"e_1_3_2_1_187_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.06.007"},{"key":"e_1_3_2_1_188_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2349160"},{"key":"e_1_3_2_1_189_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO 2019","author":"Karavaev Vitalii","year":"2036","unstructured":"[KAD19] Vitalii Karavaev, Denis Antipov, and Benjamin Doerr. Theoretical and empirical study of the (1 + (\u03bb, \u03bb)) EA on the LeadingOnes problem. In Genetic and Evolutionary Computation Conference, GECCO 2019, Companion Material, pages 2036\u20132039. ACM, 2019."},{"key":"e_1_3_2_1_190_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688443"},{"key":"e_1_3_2_1_191_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2308294"},{"key":"e_1_3_2_1_192_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114181"},{"key":"e_1_3_2_1_193_1","volume-title":"PPSN 2010","author":"Kratsch Stefan","year":"2010","unstructured":"[KLNO10] Stefan Kratsch, Per Kristian Lehre, Frank Neumann, and Pietro Simone Oliveto. Fixed parameter evolutionary algorithms and maximum leaf spanning trees: a matter of mutation. In Parallel Problem Solving from Nature, PPSN 2010, Part I, pages 204\u2013213. Springer, 2010."},{"key":"e_1_3_2_1_194_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725502"},{"key":"e_1_3_2_1_195_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9660-4"},{"key":"e_1_3_2_1_196_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001711"},{"key":"e_1_3_2_1_197_1","volume-title":"PPSN 2020","author":"K\u00f6tzing Timo","year":"2020","unstructured":"[KW20a] Timo K\u00f6tzing and Carsten Witt. Improved fixed-budget results via drift analysis. In Parallel Problem Solving from Nature, PPSN 2020, Part II, pages 648\u2013660. Springer, 2020."},{"key":"e_1_3_2_1_198_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.06.004"},{"key":"e_1_3_2_1_199_1","first-page":"253","volume-title":"PPSN","author":"Lehre Per Kristian","year":"2010","unstructured":"[Leh10] Per Kristian Lehre. Negative drift in populations. In Parallel Problem Solving from Nature, PPSN 2010, pages 244\u2013253. Springer, 2010."},{"key":"e_1_3_2_1_200_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001855"},{"key":"e_1_3_2_1_201_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2917014"},{"key":"e_1_3_2_1_202_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-022-09915-0"},{"key":"e_1_3_2_1_203_1","first-page":"102","volume-title":"ANALCO","author":"Lengler Johannes","year":"2019","unstructured":"[LMS19] Johannes Lengler, Anders Martinsson, and Angelika Steger. When does hillclimbing fail on monotone functions: an entropy compression argument. In Analytic Algorithmics and Combinatorics, ANALCO 2019, pages 94\u2013102. SIAM, 2019."},{"key":"e_1_3_2_1_204_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071317"},{"key":"e_1_3_2_1_205_1","first-page":"116","volume-title":"PPSN","author":"Lehre Per Kristian","year":"2018","unstructured":"[LN18] Per Kristian Lehre and Phan Trung Hai Nguyen. Level-based analysis of the population-based incremental learning algorithm. In Parallel Problem Solving From Nature, PPSN 2018, pages 105\u2013116. Springer, 2018."},{"key":"e_1_3_2_1_206_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340316"},{"key":"e_1_3_2_1_207_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321834"},{"key":"e_1_3_2_1_208_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00258"},{"key":"e_1_3_2_1_209_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103804"},{"key":"e_1_3_2_1_210_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967671"},{"key":"e_1_3_2_1_211_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725506"},{"key":"e_1_3_2_1_212_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548318000275"},{"key":"e_1_3_2_1_213_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00778-4"},{"key":"e_1_3_2_1_214_1","first-page":"53","volume-title":"PPSN","author":"Laumanns Marco","year":"2002","unstructured":"[LTZ+02] Marco Laumanns, Lothar Thiele, Eckart Zitzler, Emo Welzl, and Kalyanmoy Deb. Running time analysis of multi-objective evolutionary algorithms on a simple discrete optimization problem. In Parallel Problem Solving from Nature, PPSN 2002, pages 44\u201353. Springer, 2002."},{"key":"e_1_3_2_1_215_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.823470"},{"key":"e_1_3_2_1_216_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"e_1_3_2_1_217_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-9975-z"},{"key":"e_1_3_2_1_218_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-010-0610-2"},{"key":"e_1_3_2_1_219_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2112665"},{"key":"e_1_3_2_1_220_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.03.025"},{"key":"e_1_3_2_1_221_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2025\/988"},{"key":"e_1_3_2_1_222_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2501315"},{"key":"e_1_3_2_1_223_1","first-page":"26","volume-title":"PPSN","author":"M\u00fchlenbein Heinz","year":"1992","unstructured":"[M\u00fch92] Heinz M\u00fchlenbein. How genetic algorithms really work: mutation and hillclimbing. In Parallel Problem Solving from Nature, PPSN 1992, pages 15\u201326. Elsevier, 1992."},{"key":"e_1_3_2_1_224_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2004.1330957"},{"key":"e_1_3_2_1_225_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00199"},{"key":"e_1_3_2_1_226_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570016"},{"key":"e_1_3_2_1_227_1","volume-title":"PPSN 2018","author":"Neumann Frank","year":"2018","unstructured":"[NS18] Frank Neumann and Andrew M. Sutton. Runtime analysis of evolutionary algorithms for the knapsack problem with favorably correlated weights. In Parallel Problem Solving from Nature, PPSN 2018, Part II, pages 141\u2013152. Springer, 2018."},{"key":"e_1_3_2_1_228_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340315"},{"key":"e_1_3_2_1_229_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.06.023"},{"key":"e_1_3_2_1_230_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528776"},{"key":"e_1_3_2_1_231_1","volume-title":"PPSN 2010","author":"Neumann Frank","year":"2010","unstructured":"[NT10] Frank Neumann and Madeleine Theile. How crossover speeds up evolutionary algorithms for the multi-criteria all-pairs-shortest-path problem. In Parallel Problem Solving from Nature, PPSN 2010, Part I, pages 667\u2013676. Springer, 2010."},{"key":"e_1_3_2_1_232_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_233_1","doi-asserted-by":"publisher","DOI":"10.5555\/1941919"},{"key":"e_1_3_2_1_234_1","first-page":"502","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Ochoa Gabriela","year":"2002","unstructured":"[Och02] Gabriela Ochoa. Setting the mutation rate: scope and limitations of the 1\/L heuristic. In Genetic and Evolutionary Computation Conference, GECCO 2002, pages 495\u2013502. Morgan Kaufmann, 2002."},{"key":"e_1_3_2_1_235_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654218"},{"key":"e_1_3_2_1_236_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2014362"},{"key":"e_1_3_2_1_237_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i25.34918"},{"key":"e_1_3_2_1_238_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390212"},{"key":"e_1_3_2_1_239_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.07.007"},{"key":"e_1_3_2_1_240_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.002"},{"key":"e_1_3_2_1_241_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO 2009","author":"Posik Petr","year":"2009","unstructured":"[Pos09] Petr Posik. BBOB-benchmarking a simple estimation of distribution algorithm with Cauchy distribution. In Genetic and Evolutionary Computation Conference, GECCO 2009, Companion Material, pages 2309\u20132314. ACM, 2009."},{"key":"e_1_3_2_1_242_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO 2010","author":"Pos\u00edk Petr","year":"2010","unstructured":"[Pos10] Petr Pos\u00edk. Comparison of Cauchy EDA and BIPOP-CMA-ES algorithms on the BBOB noiseless testbed. In Genetic and Evolutionary Computation Conference, GECCO 2010, Companion Material, pages 1697\u20131702. ACM, 2010."},{"key":"e_1_3_2_1_243_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.03.038"},{"key":"e_1_3_2_1_244_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0488-4"},{"key":"e_1_3_2_1_245_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-021-09841-7"},{"key":"e_1_3_2_1_246_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/363"},{"key":"e_1_3_2_1_247_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/364"},{"key":"e_1_3_2_1_248_1","first-page":"846","volume-title":"PPSN","author":"Qian Chao","year":"2016","unstructured":"[QTZ16] Chao Qian, Ke Tang, and Zhi-Hua Zhou. Selection hyper-heuristics can provably be helpful in evolutionary multi-objective optimization. In Parallel Problem Solving from Nature, PPSN 2016, pages 835\u2013846. Springer, 2016."},{"key":"e_1_3_2_1_249_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.06.005"},{"key":"e_1_3_2_1_250_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.09.002"},{"key":"e_1_3_2_1_251_1","first-page":"395","volume-title":"International Joint Conference on Artificial Intelligence, IJCAI","author":"Qian Chao","year":"2015","unstructured":"[QYZ15] Chao Qian, Yang Yu, and Zhi-Hua Zhou. On constrained Boolean Pareto optimization. In International Joint Conference on Artificial Intelligence, IJCAI 2015, pages 389\u2013395. AAAI Press, 2015."},{"key":"e_1_3_2_1_252_1","volume-title":"PPSN 2024","author":"Ren Shengjie","year":"2024","unstructured":"[RBLQ24] Shengjie Ren, Chao Bian, Miqing Li, and Chao Qian. A first running time analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2). In Parallel Problem Solving from Nature, PPSN 2024, Part III, pages 295\u2013312. Springer, 2024."},{"key":"e_1_3_2_1_253_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012354"},{"key":"e_1_3_2_1_254_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.036"},{"key":"e_1_3_2_1_255_1","doi-asserted-by":"publisher","DOI":"10.1109\/72.265964"},{"key":"e_1_3_2_1_256_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1996.4.2.195"},{"key":"e_1_3_2_1_257_1","volume-title":"Convergence Properties of Evolutionary Algorithms","author":"Rudolph G\u00fcnter","year":"1997","unstructured":"[Rud97] G\u00fcnter Rudolph. Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kov\u00e2c, 1997."},{"key":"e_1_3_2_1_258_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0040787"},{"key":"e_1_3_2_1_259_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.700081"},{"key":"e_1_3_2_1_260_1","volume-title":"PPSN 2020","author":"Rajabi Amirhossein","year":"2020","unstructured":"[RW20] Amirhossein Rajabi and Carsten Witt. Evolutionary algorithms with self-adjusting asymmetric mutation. In Parallel Problem Solving from Nature, PPSN 2020, Part I, pages 664\u2013677. Springer, 2020."},{"key":"e_1_3_2_1_261_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459336"},{"key":"e_1_3_2_1_262_1","first-page":"168","volume-title":"EvoCOP","author":"Rajabi Amirhossein","year":"2021","unstructured":"[RW21b] Amirhossein Rajabi and Carsten Witt. Stagnation detection with randomized local search. In Evolutionary Computation in Combinatorial Optimization, EvoCOP 2021, pages 152\u2013168. Springer, 2021."},{"key":"e_1_3_2_1_263_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-00933-z"},{"key":"e_1_3_2_1_264_1","first-page":"101","volume-title":"PPSN","author":"Richter J. Neal","year":"2008","unstructured":"[RWP08] J. Neal Richter, Alden H. Wright, and John Paxton. Ignoble trails - where crossover is provably harmful. In Parallel Problem Solving from Nature, PPSN 2008, pages 92\u2013101. Springer, 2008."},{"key":"e_1_3_2_1_265_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001692"},{"key":"e_1_3_2_1_266_1","doi-asserted-by":"publisher","DOI":"10.1016\/0375-9601(87)90796-1"},{"key":"e_1_3_2_1_267_1","first-page":"132","volume-title":"FOGA","author":"Shapiro Jonathan L.","year":"2002","unstructured":"[Sha02] Jonathan L. Shapiro. The sensitivity of PBIL to its learning rate, and how detailed balance can remove it. In Foundations of Genetic Algorithms, FOGA 2002, pages 115\u2013132. Morgan Kaufmann, 2002."},{"key":"e_1_3_2_1_268_1","doi-asserted-by":"publisher","DOI":"10.1162\/1063656053583414"},{"key":"e_1_3_2_1_269_1","first-page":"101","volume-title":"PPSN","author":"Shapiro Jonathan L.","year":"2006","unstructured":"[Sha06] Jonathan L. Shapiro. Diversity loss in general estimation of distribution algorithms. In Parallel Problem Solving from Nature, PPSN 2006, pages 92\u2013101. Springer, 2006."},{"key":"e_1_3_2_1_270_1","first-page":"1111","volume-title":"AAAI Conference on Artificial Intelligence, AAAI","author":"Andrew","year":"2012","unstructured":"[SN12] Andrew M. Sutton and Frank Neumann. A parameterized runtime analysis of evolutionary algorithms for the Euclidean traveling salesperson problem. In AAAI Conference on Artificial Intelligence, AAAI 2012, pages 1105\u20131111. AAAI Press, 2012."},{"key":"e_1_3_2_1_271_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00119"},{"key":"e_1_3_2_1_272_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9606-2"},{"key":"e_1_3_2_1_273_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144099"},{"key":"e_1_3_2_1_274_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.06.008"},{"key":"e_1_3_2_1_275_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2008.16.4.557"},{"key":"e_1_3_2_1_276_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"key":"e_1_3_2_1_277_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068202"},{"key":"e_1_3_2_1_278_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2202241"},{"key":"e_1_3_2_1_279_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00171"},{"key":"e_1_3_2_1_280_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00671-0"},{"key":"e_1_3_2_1_281_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00809-8"},{"key":"e_1_3_2_1_282_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.03.047"},{"key":"e_1_3_2_1_283_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0480-z"},{"key":"e_1_3_2_1_284_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17517-6_31"},{"key":"e_1_3_2_1_285_1","first-page":"364","volume-title":"EMO","author":"Thierens Dirk","year":"2003","unstructured":"[Thi03] Dirk Thierens. Convergence time analysis for the multi-objective counting ones problem. In Evolutionary Multi-Criterion Optimization, EMO 2003, pages 355\u2013364. Springer, 2003."},{"key":"e_1_3_2_1_286_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/628"},{"key":"e_1_3_2_1_287_1","volume-title":"PPSN 2024","author":"Wietheger Simon","year":"2024","unstructured":"[WD24] Simon Wietheger and Benjamin Doerr. Near-tight runtime guarantees for many-objective evolutionary algorithms. In Parallel Problem Solving from Nature, PPSN 2024, Part IV, pages 153\u2013168. Springer, 2024."},{"key":"e_1_3_2_1_288_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"},{"key":"e_1_3_2_1_289_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365606776022751"},{"key":"e_1_3_2_1_290_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000600"},{"key":"e_1_3_2_1_291_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598237"},{"key":"e_1_3_2_1_292_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0463-0"},{"key":"e_1_3_2_1_293_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.08.014"},{"key":"e_1_3_2_1_294_1","first-page":"1459","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Richard","year":"2007","unstructured":"[WJ07] Richard A. Watson and Thomas Jansen. A building-block royal road where crossover is provably essential. In Genetic and Evolutionary Computation Conference, GECCO 2007, pages 1452\u20131459. ACM, 2007."},{"key":"e_1_3_2_1_295_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908862"},{"key":"e_1_3_2_1_296_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/234"},{"key":"e_1_3_2_1_297_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459381"},{"key":"e_1_3_2_1_298_1","series-title":"Lecture Notes in Computer Science","first-page":"162","volume-title":"Evolutionary Programming","author":"Yao Xin","unstructured":"[YL97] Xin Yao and Yong Liu. Fast evolution strategies. In Evolutionary Programming, volume 1213 of Lecture Notes in Computer Science, pages 151\u2013162. Springer, 1997."},{"key":"e_1_3_2_1_299_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771163"},{"key":"e_1_3_2_1_300_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2378891"},{"key":"e_1_3_2_1_301_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528847"},{"key":"e_1_3_2_1_302_1","first-page":"1","article-title":"From understanding genetic drift to a smart-restart mechanism for estimation-of-distribution algorithms","volume":"24","author":"Zheng Weijie","year":"2023","unstructured":"[ZD23a] Weijie Zheng and Benjamin Doerr. From understanding genetic drift to a smart-restart mechanism for estimation-of-distribution algorithms. Journal of Machine Learning Research, 24:1\u201340, 2023.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_303_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2023.104016"},{"key":"e_1_3_2_1_304_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2024.3402996"},{"key":"e_1_3_2_1_305_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3320278"},{"key":"e_1_3_2_1_306_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i18.30077"},{"key":"e_1_3_2_1_307_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"e_1_3_2_1_308_1","doi-asserted-by":"publisher","DOI":"10.1145\/3520304.3534070"},{"key":"e_1_3_2_1_309_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638530.3664078"},{"key":"e_1_3_2_1_310_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.03.001"}],"event":{"name":"GECCO '25 Companion: Genetic and Evolutionary Computation Conference Companion","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"NH Malaga Hotel Malaga Spain","acronym":"GECCO '25 Companion"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712255.3716526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:06:57Z","timestamp":1759838817000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712255.3716526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,14]]},"references-count":310,"alternative-id":["10.1145\/3712255.3716526","10.1145\/3712255"],"URL":"https:\/\/doi.org\/10.1145\/3712255.3716526","relation":{},"subject":[],"published":{"date-parts":[[2025,7,14]]},"assertion":[{"value":"2025-08-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}