{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T16:43:57Z","timestamp":1751993037308,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":300,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"FMJH Program Gaspard Monge for optimization and operations research and their interactions with data science"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638530.3648402","type":"proceedings-article","created":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T12:55:52Z","timestamp":1728996952000},"page":"800-829","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Gentle Introduction to Theory (for Non-Theoreticians)"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9786-220X","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":[[2024,8]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","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--573. Springer, 2020."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1007\/s00453-022-00957-5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1007\/s00453-023-01098-z"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","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--559. Springer, 2020."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1007\/s00453-020-00731-5"},{"key":"e_1_3_2_1_8_1","first-page":"1459","volume-title":"Genetic and Evolutionary Computation Conference, GECCO 2018","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--1466. ACM, 2018."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/3638529.3654196"},{"key":"e_1_3_2_1_10_1","first-page":"169","volume-title":"FOGA 2019","author":"Antipov Denis","year":"2019","unstructured":"[ADK19] Denis Antipov, Benjamin Doerr, and Vitalii Karavaev. A tight runtime analysis for the (1 + (\u03bc, \u03bb)) GA on LeadingOnes. In Foundations of Genetic Algorithms, FOGA 2019, pages 169--182. ACM, 2019."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1007\/s00453-021-00907-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/3321707.3321838"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/CEC.2014.6900602"},{"key":"e_1_3_2_1_14_1","first-page":"2","volume-title":"International Conference on Genetic Algorithms, ICGA 1993","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--8. Morgan Kaufmann, 1993."},{"key":"e_1_3_2_1_15_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."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/3319619.3322067"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/3377929.3398148"},{"key":"e_1_3_2_1_18_1","first-page":"59","volume-title":"FOGA 2009","author":"Baswana Surender","year":"2009","unstructured":"[BBD+09] Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, and Frank Neumann. Computing single source shortest paths using single-objective fitness. In Foundations of Genetic Algorithms, FOGA 2009, pages 59--66. ACM, 2009."},{"key":"e_1_3_2_1_19_1","first-page":"4","volume-title":"Genetic and Evolutionary Computation Conference, GECCO 2021","author":"Benbaki Riade","year":"2021","unstructured":"[BBD21] Riade Benbaki, Ziyad Benomar, and Benjamin Doerr. A rigorous runtime analysis of the 2-MMASib on jump functions: ant colony optimizers can cope well with local optima. In Genetic and Evolutionary Computation Conference, GECCO 2021, pages 4--13. ACM, 2021."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/s00453-022-00977-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/3071178.3071297"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/3377930.3390184"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/3583131.3590523"},{"key":"e_1_3_2_1_24_1","first-page":"1","volume-title":"PPSN 2010","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--10. Springer, 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1887\/0750308958"},{"key":"e_1_3_2_1_26_1","first-page":"651","volume-title":"PPSN 2008","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--660. Springer, 2008."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1609\/aaai.v34i04.5726"},{"key":"e_1_3_2_1_28_1","first-page":"892","volume-title":"PPSN 2014","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--901. Springer, 2014."},{"key":"e_1_3_2_1_29_1","first-page":"428","volume-title":"PPSN 2022","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--441. Springer, 2022."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.24963\/ijcai.2018\/195"},{"key":"e_1_3_2_1_31_1","first-page":"102","volume-title":"FOGA 2019","author":"Bossek Jakob","year":"2019","unstructured":"[BS19] Jakob Bossek and Dirk Sudholt. Time complexity analysis of RLS and (1+1) EA for the edge coloring problem. In Foundations of Genetic Algorithms, FOGA 2019, pages 102--115. ACM, 2019."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.24963\/ijcai.2023\/612"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1109\/TEVC.2017.2753538"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.24963\/ijcai.2023\/613"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1109\/TEVC.2020.2985450"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1162\/EVCO_a_00147"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1109\/TEVC.2017.2745715"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1007\/s00453-020-00743-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.24963\/ijcai.2019\/171"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.24963\/ijcai.2021\/229"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1145\/3205455.3205591"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1145\/2739480.2754684"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1145\/2739480.2754683"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1007\/s00453-017-0354-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_45_1","DOI":"10.1007\/978-3-030-29414-4_6"},{"key":"e_1_3_2_1_46_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--484. Springer, 2022."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_47_1","DOI":"10.1145\/2463372.2463480"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_48_1","DOI":"10.1016\/j.tcs.2014.11.028"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_49_1","DOI":"10.24963\/ijcai.2023\/616"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_50_1","DOI":"10.1145\/2576768.2598341"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_51_1","DOI":"10.1016\/j.artint.2014.07.009"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_52_1","DOI":"10.1145\/3071178.3071233"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_53_1","DOI":"10.1007\/s00453-017-0341-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_54_1","DOI":"10.1007\/s00453-021-00854-3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_55_1","DOI":"10.1145\/3583131.3590509"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_56_1","DOI":"10.1145\/3321707.3321731"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_57_1","DOI":"10.1609\/aaai.v34i02.5504"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_58_1","DOI":"10.1145\/2987372"},{"key":"e_1_3_2_1_59_1","first-page":"824","volume-title":"PPSN 2016","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--834. Springer, 2016."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_60_1","DOI":"10.1016\/j.tcs.2019.06.014"},{"key":"e_1_3_2_1_61_1","first-page":"20683","volume-title":"Conference on Artificial Intelligence, AAAI 2024","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--20691. AAAI Press, 2024."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_62_1","DOI":"10.1145\/2908812.2908956"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_63_1","DOI":"10.1109\/TEVC.2017.2724201"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_64_1","DOI":"10.1007\/s00453-023-01146-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_65_1","DOI":"10.1145\/2908812.2908827"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_66_1","DOI":"10.1007\/s00453-018-0502-x"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_67_1","DOI":"10.1109\/CEC.2007.4424704"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_68_1","DOI":"10.1016\/j.tcs.2010.10.035"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_69_1","DOI":"10.1145\/2330163.2330167"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_70_1","DOI":"10.1162\/evco.2007.15.4.401"},{"key":"e_1_3_2_1_71_1","first-page":"520","volume-title":"Genetic and Evolutionary Computation Conference, GECCO 2022","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--528. ACM, 2022."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_72_1","DOI":"10.1145\/1276958.1277192"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_73_1","DOI":"10.1145\/1830483.1830618"},{"key":"e_1_3_2_1_74_1","first-page":"163","volume-title":"FOGA 2011","author":"Doerr Benjamin","year":"2011","unstructured":"[DJK+11] Benjamin Doerr, Daniel Johannsen, Timo K\u00f6tzing, Per Kristian Lehre, Markus Wagner, and Carola Winzen. Faster black-box algorithms through higher arity operators. In Foundations of Genetic Algorithms, FOGA 2011, pages 163--172. ACM, 2011."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_75_1","DOI":"10.1016\/j.tcs.2012.10.059"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_76_1","DOI":"10.1007\/s00453-016-0187-y"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_77_1","DOI":"10.1162\/EVCO_a_00055"},{"key":"e_1_3_2_1_78_1","first-page":"13","volume-title":"PPSN 1998","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--22. Springer, 1998."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_79_1","DOI":"10.1109\/ICEC.1998.700079"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_80_1","DOI":"10.1016\/S0304-3975(01)00182-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_81_1","DOI":"10.1145\/1830483.1830748"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_82_1","DOI":"10.1007\/s00453-012-9622-x"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_83_1","DOI":"10.1145\/2463372.2463565"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_84_1","DOI":"10.1016\/j.tcs.2014.03.015"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_85_1","DOI":"10.1145\/3377930.3390177"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_86_1","DOI":"10.1109\/TEVC.2019.2956633"},{"key":"e_1_3_2_1_87_1","first-page":"51","volume-title":"EvoCOP 2020","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--66. Springer, 2020."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_88_1","DOI":"10.1145\/3449639.3459352"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_89_1","DOI":"10.1007\/s00453-020-00775-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_90_1","DOI":"10.1016\/j.tcs.2020.11.028"},{"key":"e_1_3_2_1_91_1","first-page":"245","volume-title":"FOCI 2007","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--250. IEEE, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_92_1","DOI":"10.1145\/3638529.3654140"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_93_1","DOI":"10.1007\/978-3-031-70071-2_13"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_94_1","DOI":"10.1145\/2739480.2754814"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_95_1","DOI":"10.1007\/s00453-015-0103-x"},{"key":"e_1_3_2_1_96_1","first-page":"803","volume-title":"PPSN 2016","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--813. Springer, 2016."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_97_1","DOI":"10.1145\/3071178.3071301"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_98_1","DOI":"10.1007\/s00453-018-0507-5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_99_1","DOI":"10.1145\/3205455.3205611"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_100_1","DOI":"10.1007\/978-3-030-29414-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_101_1","DOI":"10.1145\/3205455.3205563"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_102_1","DOI":"10.1145\/2908812.2908885"},{"key":"e_1_3_2_1_103_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--618. Springer, 2020."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_104_1","DOI":"10.1016\/j.tcs.2020.09.032"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_105_1","DOI":"10.1007\/s00453-020-00780-w"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_106_1","DOI":"10.1007\/s00453-021-00896-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_107_1","DOI":"10.1145\/3583131.3590421"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_108_1","DOI":"10.1609\/aaai.v37i10.26460"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_109_1","DOI":"10.1109\/4235.996017"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_110_1","DOI":"10.1145\/2739480.2754760"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_111_1","DOI":"10.1109\/TEVC.2023.3250552"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_112_1","DOI":"10.1609\/aaai.v37i10.26462"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_113_1","DOI":"10.1609\/aaai.v37i10.26461"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_114_1","DOI":"10.1016\/j.tcs.2022.12.020"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_115_1","DOI":"10.1109\/CEC.2002.1006209"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_116_1","DOI":"10.5555\/1761233.1761353"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_117_1","DOI":"10.1007\/978-3-540-24854-5_107"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_118_1","DOI":"10.1007\/s11047-006-9001-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_119_1","DOI":"10.1145\/3321707.3321837"},{"key":"e_1_3_2_1_120_1","first-page":"48","volume-title":"FOGA 2013","author":"Doerr Benjamin","year":"2013","unstructured":"[DSW13] Benjamin Doerr, Dirk Sudholt, and Carsten Witt. When do evolutionary algorithms optimize separable functions in parallel? In Foundations of Genetic Algorithms, FOGA 2013, pages 48--59. ACM, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_121_1","DOI":"10.1145\/1569901.1569937"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_122_1","DOI":"10.1016\/j.ipl.2011.10.004"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_123_1","DOI":"10.1145\/2330163.2330345"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_124_1","DOI":"10.1007\/s00453-012-9684-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_125_1","DOI":"10.1007\/s00453-020-00726-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_126_1","DOI":"10.1145\/3377930.3390163"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_127_1","DOI":"10.1109\/TEVC.2020.2987361"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_128_1","DOI":"10.1145\/3449726.3462719"},{"key":"e_1_3_2_1_129_1","first-page":"4","volume-title":"PPSN 1990","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--12. Springer, 1990."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_130_1","DOI":"10.1016\/j.tcs.2019.05.021"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_131_1","DOI":"10.1109\/4235.771166"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_132_1","DOI":"10.1609\/aaai.v33i01.33012272"},{"key":"e_1_3_2_1_133_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--145. Springer, 2018."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_134_1","DOI":"10.1162\/evco.2009.17.1.3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_135_1","DOI":"10.1145\/1276958.1277194"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_136_1","DOI":"10.1016\/j.tcs.2008.08.021"},{"key":"e_1_3_2_1_137_1","first-page":"65","volume-title":"FOGA 2013","author":"Feldmann Matthias","year":"2013","unstructured":"[FK13] Matthias Feldmann and Timo K\u00f6tzing. Optimizing expected path lengths with ant colony optimization using fitness proportional update. In Foundations of Genetic Algorithms, FOGA 2013, pages 65--74. ACM, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_138_1","DOI":"10.1145\/2908812.2908895"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_139_1","DOI":"10.1109\/TEVC.2016.2613739"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_140_1","DOI":"10.1145\/3512290.3528713"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_141_1","DOI":"10.1162\/EVCO_a_00159"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_142_1","DOI":"10.1109\/72.265956"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_143_1","DOI":"10.1145\/3205455.3205515"},{"key":"e_1_3_2_1_144_1","first-page":"1113","volume-title":"GECCO 2004","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--1124. Springer, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_145_1","DOI":"10.1016\/j.tcs.2005.04.002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_146_1","DOI":"10.1007\/s00453-018-0429-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_147_1","DOI":"10.1109\/CEC.2003.1299908"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_148_1","DOI":"10.1007\/s00453-015-0072-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_149_1","DOI":"10.1162\/evco.1999.7.2.173"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_150_1","DOI":"10.5555\/534133"},{"key":"e_1_3_2_1_151_1","first-page":"785","volume-title":"Genetic and Evolutionary Computation Conference, GECCO 2014","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--792. ACM, 2014."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_152_1","DOI":"10.1007\/3-540-36494-3_37"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_153_1","DOI":"10.1007\/s00453-016-0214-z"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_154_1","DOI":"10.1007\/s00453-017-0360-y"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_155_1","DOI":"10.1016\/S0377-2217(98)00262-8"},{"key":"e_1_3_2_1_156_1","first-page":"62","volume-title":"PPSN 2006","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--71. Springer, 2006."},{"key":"e_1_3_2_1_157_1","first-page":"149","volume-title":"PPSN 1994","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--158. Springer, 1994."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_158_1","DOI":"10.1145\/1389095.1389277"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_159_1","DOI":"10.1109\/4235.797971"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_160_1","DOI":"10.1145\/3205455.3205608"},{"key":"e_1_3_2_1_161_1","first-page":"1","volume-title":"FOGA 2021","author":"Hevia Fajardo Mario Alejandro","year":"2021","unstructured":"[HS21a] Mario Alejandro Hevia Fajardo and Dirk Sudholt. Self-adjusting offspring population sizes outperform fixed parameters on the cliff function. In Foundations of Genetic Algorithms, FOGA 2021, pages 5:1--5:15. ACM, 2021."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_162_1","DOI":"10.1145\/3449639.3459338"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_163_1","DOI":"10.1145\/3564755"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_164_1","DOI":"10.1016\/S0004-3702(01)00058-3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_165_1","DOI":"10.1609\/aaai.v34i03.5615"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_166_1","DOI":"10.1109\/TCYB.2019.2930979"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_167_1","DOI":"10.1609\/aaai.v33i01.33012296"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_168_1","DOI":"10.24963\/ijcai.2021\/232"},{"key":"e_1_3_2_1_169_1","first-page":"41","volume-title":"PPSN 2008","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--51. Springer, 2008."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_170_1","DOI":"10.5555\/1757524.1757528"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_171_1","DOI":"10.1007\/978-3-642-17339-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_172_1","DOI":"10.1162\/106365605774666921"},{"key":"e_1_3_2_1_173_1","first-page":"87","volume-title":"FOGA 2013","author":"Jansen Thomas","year":"2013","unstructured":"[JOZ13] Thomas Jansen, Pietro S. Oliveto, and Christine Zarges. Approximating vertex cover using edge-based representations. In Foundations of Genetic Algorithms, FOGA 2013, pages 87--96. ACM, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_174_1","DOI":"10.1145\/1068009.1068152"},{"key":"e_1_3_2_1_175_1","first-page":"25","volume-title":"FOCI 2007","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--32. IEEE, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_176_1","DOI":"10.5555\/647909.740300"},{"key":"e_1_3_2_1_177_1","first-page":"89","volume-title":"PPSN 2000","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--98. Springer, 2000."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_178_1","DOI":"10.1007\/s00453-002-0940-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_179_1","DOI":"10.5555\/1099040.1704883"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_180_1","DOI":"10.1016\/j.jda.2005.01.002"},{"key":"e_1_3_2_1_181_1","first-page":"1325","volume-title":"Genetic and Evolutionary Computation Conference, GECCO 2012","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--1332. ACM, 2012."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_182_1","DOI":"10.1016\/j.tcs.2013.06.007"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_183_1","DOI":"10.1109\/TEVC.2014.2349160"},{"key":"e_1_3_2_1_184_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--2039. ACM, 2019."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_185_1","DOI":"10.1109\/CEC.2006.1688443"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_186_1","DOI":"10.1109\/TEVC.2014.2308294"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_187_1","DOI":"10.1016\/j.tcs.2023.114181"},{"key":"e_1_3_2_1_188_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--213. Springer, 2010."},{"key":"e_1_3_2_1_189_1","first-page":"40","volume-title":"FOGA 2015","author":"K\u00f6tzing Timo","year":"2015","unstructured":"[KLW15] Timo K\u00f6tzing, Andrei Lissovoi, and Carsten Witt. (1+1) EA on generalized dynamic OneMax. In Foundations of Genetic Algorithms, FOGA 2015, pages 40--51. ACM, 2015."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_190_1","DOI":"10.1007\/s00453-012-9660-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_191_1","DOI":"10.1145\/2001576.2001711"},{"key":"e_1_3_2_1_192_1","volume-title":"PPSN 2020","author":"Kotzing Timo","year":"2020","unstructured":"[KW20a] Timo Kotzing and Carsten Witt. Improved fixed-budget results via drift analysis. In Parallel Problem Solving from Nature, PPSN 2020, Part II, pages 648--660. Springer, 2020."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_193_1","DOI":"10.1016\/j.tcs.2018.06.004"},{"key":"e_1_3_2_1_194_1","first-page":"244","volume-title":"PPSN 2010","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--253. Springer, 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_195_1","DOI":"10.1145\/2001576.2001855"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_196_1","DOI":"10.1109\/TEVC.2019.2917014"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_197_1","DOI":"10.1007\/s11047-022-09915-0"},{"key":"e_1_3_2_1_198_1","first-page":"94","volume-title":"ANALCO 2019","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--102. SIAM, 2019."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_199_1","DOI":"10.1145\/3071178.3071317"},{"key":"e_1_3_2_1_200_1","first-page":"105","volume-title":"PPSN 2018","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--116. Springer, 2018."},{"key":"e_1_3_2_1_201_1","first-page":"154","volume-title":"FOGA 2019","author":"Lehre Per Kristian","year":"2019","unstructured":"[LN19a] Per Kristian Lehre and Phan Trung Hai Nguyen. On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help. In Foundations of Genetic Algorithms, FOGA 2019, pages 154--168. ACM, 2019."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_202_1","DOI":"10.1145\/3321707.3321834"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_203_1","DOI":"10.1162\/evco_a_00258"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_204_1","DOI":"10.1016\/j.artint.2022.103804"},{"key":"e_1_3_2_1_205_1","first-page":"181","volume-title":"FOGA 2011","author":"L\u00e4ssig J\u00f6rg","year":"2011","unstructured":"[LS11] J\u00f6rg L\u00e4ssig and Dirk Sudholt. Adaptive population models for offspring populations and parallel evolutionary algorithms. In Foundations of Genetic Algorithms, FOGA 2011, pages 181--192. ACM, 2011."},{"key":"e_1_3_2_1_206_1","first-page":"52","volume-title":"FOGA 2015","author":"Lengler Johannes","year":"2015","unstructured":"[LS15] Johannes Lengler and Nicholas Spooner. Fixed budget performance of the (1+1) EA on linear functions. In Foundations of Genetic Algorithms, FOGA 2015, pages 52--61. ACM, 2015."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_207_1","DOI":"10.1017\/S0963548318000275"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_208_1","DOI":"10.1007\/s00453-020-00778-4"},{"key":"e_1_3_2_1_209_1","first-page":"44","volume-title":"PPSN 2002","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--53. Springer, 2002."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_210_1","DOI":"10.1109\/TEVC.2004.823470"},{"key":"e_1_3_2_1_211_1","volume-title":"Black-box search by unbiased variation Algorithmica, 64:623--642","author":"Lehre Per Kristian","year":"2012","unstructured":"[LW12] Per Kristian Lehre and Carsten Witt. Black-box search by unbiased variation Algorithmica, 64:623--642, 2012."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_212_1","DOI":"10.1007\/s00453-015-9975-z"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_213_1","DOI":"10.1007\/s00500-010-0610-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_214_1","DOI":"10.1109\/TEVC.2011.2112665"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_215_1","DOI":"10.1016\/j.tcs.2021.03.025"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_216_1","DOI":"10.1109\/TEVC.2015.2501315"},{"key":"e_1_3_2_1_217_1","first-page":"15","volume-title":"PPSN 1992","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--26. Elsevier, 1992."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_218_1","DOI":"10.1109\/CEC.2004.1330957"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_219_1","DOI":"10.1162\/evco_a_00199"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_220_1","DOI":"10.1145\/1569901.1570016"},{"key":"e_1_3_2_1_221_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--152. Springer, 2018."},{"key":"e_1_3_2_1_222_1","first-page":"147","volume-title":"FOGA 2019","author":"Neumann Frank","year":"2019","unstructured":"[NS19] Frank Neumann and Andrew M. Sutton. Runtime analysis of the (1 +1) evolutionary algorithm for the chance-constrained knapsack problem. In Foundations of Genetic Algorithms, FOGA 2019, pages 147--153. ACM, 2019."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_223_1","DOI":"10.1016\/j.tcs.2014.06.023"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_224_1","DOI":"10.1145\/3512290.3528776"},{"key":"e_1_3_2_1_225_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--676. Springer, 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_226_1","DOI":"10.1016\/j.tcs.2006.11.002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_227_1","DOI":"10.5555\/1941919"},{"key":"e_1_3_2_1_228_1","first-page":"495","volume-title":"Genetic and Evolutionary Computation Conference, GECCO 2002","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--502. Morgan Kaufmann, 2002."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_229_1","DOI":"10.1145\/3638529.3654218"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_230_1","DOI":"10.1109\/TEVC.2009.2014362"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_231_1","DOI":"10.1145\/3377930.3390212"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_232_1","DOI":"10.1016\/j.tcs.2018.07.007"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_233_1","DOI":"10.1016\/j.tcs.2015.01.002"},{"key":"e_1_3_2_1_234_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--2314. ACM, 2009."},{"key":"e_1_3_2_1_235_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--1702. ACM, 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_236_1","DOI":"10.1016\/j.tcs.2004.03.038"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_237_1","DOI":"10.1007\/s00453-018-0488-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_238_1","DOI":"10.1007\/s11047-021-09841-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_239_1","DOI":"10.24963\/ijcai.2017\/363"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_240_1","DOI":"10.24963\/ijcai.2017\/364"},{"key":"e_1_3_2_1_241_1","first-page":"835","volume-title":"PPSN 2016","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--846. Springer, 2016."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_242_1","DOI":"10.1016\/j.artint.2019.06.005"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_243_1","DOI":"10.1016\/j.artint.2013.09.002"},{"key":"e_1_3_2_1_244_1","first-page":"389","volume-title":"International Joint Conference on Artificial Intelligence, IJCAI 2015","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--395. AAAI Press, 2015."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_245_1","DOI":"10.1609\/aaai.v33i01.33012354"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_246_1","DOI":"10.1016\/j.tcs.2013.09.036"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_247_1","DOI":"10.1109\/72.265964"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_248_1","DOI":"10.1162\/evco.1996.4.2.195"},{"key":"e_1_3_2_1_249_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\u0103c, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_250_1","DOI":"10.1007\/BFb0040787"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_251_1","DOI":"10.1109\/ICEC.1998.700081"},{"key":"e_1_3_2_1_252_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--677. Springer, 2020."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_253_1","DOI":"10.1145\/3449639.3459336"},{"key":"e_1_3_2_1_254_1","first-page":"152","volume-title":"EvoCOP 2021","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--168. Springer, 2021."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_255_1","DOI":"10.1007\/s00453-022-00933-z"},{"key":"e_1_3_2_1_256_1","first-page":"92","volume-title":"PPSN 2008","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--101. Springer, 2008."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_257_1","DOI":"10.1145\/2001576.2001692"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_258_1","DOI":"10.1016\/0375-9601(87)90796-1"},{"key":"e_1_3_2_1_259_1","first-page":"115","volume-title":"Foundations of Genetic Algorithms, 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--132. Morgan Kaufmann, 2002."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_260_1","DOI":"10.1162\/1063656053583414"},{"key":"e_1_3_2_1_261_1","first-page":"92","volume-title":"PPSN 2006","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--101. Springer, 2006."},{"key":"e_1_3_2_1_262_1","first-page":"1105","volume-title":"AAAI Conference on Artificial Intelligence, AAAI 2012","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--1111. AAAI Press, 2012."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_263_1","DOI":"10.1162\/EVCO_a_00119"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_264_1","DOI":"10.1007\/s00453-011-9606-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_265_1","DOI":"10.1145\/1143997.1144099"},{"key":"e_1_3_2_1_266_1","volume-title":"Finding large cliques in sparse semi-random graphs by simple randomized search heuristics Theoretical Computer Science, 386:114--131","author":"Storch Tobias","year":"2007","unstructured":"[Sto07] Tobias Storch. Finding large cliques in sparse semi-random graphs by simple randomized search heuristics Theoretical Computer Science, 386:114--131, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_267_1","DOI":"10.1162\/evco.2008.16.4.557"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_268_1","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_269_1","DOI":"10.1145\/1068009.1068202"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_270_1","DOI":"10.1109\/TEVC.2012.2202241"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_271_1","DOI":"10.1162\/EVCO_a_00171"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_272_1","DOI":"10.1007\/s00453-020-00671-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_273_1","DOI":"10.1007\/s00453-021-00809-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_274_1","DOI":"10.1016\/j.tcs.2004.03.047"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_275_1","DOI":"10.1007\/s00453-018-0480-z"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_276_1","DOI":"10.1007\/978-3-642-17517-6_31"},{"key":"e_1_3_2_1_277_1","first-page":"355","volume-title":"EMO 2003","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--364. Springer, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_278_1","DOI":"10.24963\/ijcai.2023\/628"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_279_1","DOI":"10.1007\/978-3-540-31856-9_4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_280_1","DOI":"10.1162\/106365606776022751"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_281_1","DOI":"10.1017\/S0963548312000600"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_282_1","DOI":"10.1145\/2576768.2598237"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_283_1","DOI":"10.1007\/s00453-018-0463-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_284_1","DOI":"10.1016\/j.tcs.2022.08.014"},{"key":"e_1_3_2_1_285_1","first-page":"1452","volume-title":"Genetic and Evolutionary Computation Conference, GECCO 2007","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--1459. ACM, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_286_1","DOI":"10.1145\/2908812.2908862"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_287_1","DOI":"10.24963\/ijcai.2021\/234"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_288_1","DOI":"10.1145\/3449639.3459381"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_289_1","DOI":"10.5555\/647901.738817"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_290_1","DOI":"10.1109\/4235.771163"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_291_1","DOI":"10.1109\/TEVC.2014.2378891"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_292_1","DOI":"10.1145\/3512290.3528847"},{"key":"e_1_3_2_1_293_1","first-page":"1","article-title":"From understanding genetic drift to a smart-restart mechanism for estimation-of-distribution algorithms","volume":"24","author":"Zheng Weyijie","year":"2023","unstructured":"[ZD23a] Weyijie 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--40, 2023.","journal-title":"Journal of Machine Learning Research"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_294_1","DOI":"10.1016\/j.artint.2023.104016"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_295_1","DOI":"10.1109\/TEVC.2023.3320278"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_296_1","DOI":"10.1609\/aaai.v38i18.30077"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_297_1","DOI":"10.1109\/TEVC.2007.892759"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_298_1","DOI":"10.1145\/3520304.3534070"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_299_1","DOI":"10.1609\/aaai.v38i18.30078"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_300_1","DOI":"10.1016\/j.swevo.2011.03.001"}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"acronym":"GECCO '24 Companion","name":"GECCO '24 Companion: Genetic and Evolutionary Computation Conference Companion","location":"Melbourne VIC Australia"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638530.3648402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638530.3648402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:56:54Z","timestamp":1750291014000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638530.3648402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":300,"alternative-id":["10.1145\/3638530.3648402","10.1145\/3638530"],"URL":"https:\/\/doi.org\/10.1145\/3638530.3648402","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-08-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}