{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:24:29Z","timestamp":1759847069276,"version":"3.37.3"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s00453-022-00977-1","type":"journal-article","created":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T09:04:58Z","timestamp":1653296698000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics"],"prefix":"10.1007","volume":"86","author":[{"given":"Henry","family":"Bambury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Bultel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9786-220X","authenticated-orcid":false,"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,23]]},"reference":[{"key":"977_CR1","doi-asserted-by":"crossref","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Fast mutation in crossover-based algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1268\u20131276. ACM (2020)","DOI":"10.1145\/3377930.3390172"},{"key":"977_CR2","doi-asserted-by":"crossref","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: First steps towards a runtime analysis when starting with a good solution. In: Parallel Problem Solving From Nature, PPSN 2020, Part\u00a0II, pp. 560\u2013573. Springer (2020)","DOI":"10.1007\/978-3-030-58115-2_39"},{"key":"977_CR3","doi-asserted-by":"crossref","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1115\u20131123. ACM (2021)","DOI":"10.1145\/3449639.3459377"},{"key":"977_CR4","doi-asserted-by":"crossref","unstructured":"Auger, A., Doerr, B., (eds).: Theory of Randomized Search Heuristics. World Scientific Publishing (2011)","DOI":"10.1142\/7438"},{"key":"977_CR5","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B.: Runtime analysis of a heavy-tailed $$(1+(\\lambda , \\lambda ))$$ genetic algorithm on jump functions. In: Parallel Problem Solving From Nature, PPSN 2020, Part\u00a0II, pp. 545\u2013559. Springer (2020)","DOI":"10.1007\/978-3-030-58115-2_38"},{"key":"977_CR6","unstructured":"Antipov, D., Doerr, B., Karavaev, V.: The $$(1 + (\\lambda ,\\lambda ))$$ GA is even faster on multimodal problems. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1259\u20131267. ACM (2020)"},{"key":"977_CR7","doi-asserted-by":"crossref","unstructured":"Bambury, H., Bultel, A., Doerr, B.: Generalized jump functions. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1124\u20131132. ACM (2021)","DOI":"10.1145\/3449639.3459367"},{"key":"977_CR8","doi-asserted-by":"crossref","unstructured":"Benbaki, R., Benomar, Z., Doerr, B.: A rigorous runtime analysis of the 2-MMAS$$_{\\rm ib}$$ on jump functions: ant colony optimizers can cope well with local optima. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 4\u201313. ACM (2021)","DOI":"10.1145\/3449639.3459350"},{"key":"977_CR9","doi-asserted-by":"crossref","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In: Parallel Problem Solving from Nature, PPSN 2010, pp. 1\u201310. Springer (2010)","DOI":"10.1007\/978-3-642-15844-5_1"},{"key":"977_CR10","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1109\/TEVC.2017.2745715","volume":"22","author":"D Corus","year":"2018","unstructured":"Corus, D., Oliveto, P.S.: Standard steady state genetic algorithms can hillclimb faster than mutation-only evolutionary algorithms. IEEE Trans. Evol. Computut. 22, 720\u2013732 (2018)","journal-title":"IEEE Trans. Evol. Computut."},{"key":"977_CR11","doi-asserted-by":"publisher","first-page":"3676","DOI":"10.1007\/s00453-020-00743-1","volume":"82","author":"D Corus","year":"2020","unstructured":"Corus, D., Oliveto, P.S.: On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms. Algorithmica 82, 3676\u20133706 (2020)","journal-title":"Algorithmica"},{"key":"977_CR12","doi-asserted-by":"crossref","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: On the runtime analysis of the Opt-IA artificial immune system. In: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 83\u201390. ACM (2017)","DOI":"10.1145\/3071178.3079194"},{"key":"977_CR13","doi-asserted-by":"crossref","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: Fast artificial immune systems. In: Parallel Problem Solving from Nature, PPSN 2018, Part II, pp. 67\u201378. Springer (2018)","DOI":"10.1007\/978-3-319-99259-4_6"},{"key":"977_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2014.11.028","volume":"567","author":"B Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., Ebel, F.: From black-box complexity to designing new genetic algorithms. Theor. Comput. Sci. 567, 87\u2013104 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"977_CR15","doi-asserted-by":"publisher","first-page":"1732","DOI":"10.1007\/s00453-017-0341-1","volume":"80","author":"B Doerr","year":"2018","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Static and self-adjusting mutation strengths for multi-valued decision variables. Algorithmica 80, 1732\u20131768 (2018)","journal-title":"Algorithmica"},{"key":"977_CR16","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00453-018-0477-7","volume":"81","author":"B Doerr","year":"2019","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Solving problems with unknown solution length at almost no extra cost. Algorithmica 81, 703\u2013748 (2019)","journal-title":"Algorithmica"},{"key":"977_CR17","doi-asserted-by":"crossref","unstructured":"Dang, D.C., Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Lehre, P.K., Oliveto, P.S., Sudholt, D., Sutton, A.M.: Escaping local optima with diversity mechanisms and crossover. In: Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 645\u2013652. ACM (2016)","DOI":"10.1145\/2908812.2908956"},{"key":"977_CR18","doi-asserted-by":"crossref","unstructured":"Dang, D.C., Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Lehre, P.K., Oliveto, P.S., Sudholt, D., Sutton, A.M.: Escaping local optima using crossover with emergent diversity. IEEE Trans. Evol. Comput., 22:484\u2013497 (2018)","DOI":"10.1109\/TEVC.2017.2724201"},{"key":"977_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2010.10.035","volume":"425","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Happ, E., Klein, C.: Crossover can provably be useful in evolutionary computation. Theor. Comput. Sci. 425, 17\u201333 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"977_CR20","doi-asserted-by":"crossref","unstructured":"Doerr, B., Johannsen, D., K\u00f6tzing, T., Lehre, P.K., Wagner, M., Winzen, C.: Faster black-box algorithms through higher arity operators. In: Foundations of Genetic Algorithms, FOGA 2011, pp. 163\u2013172. ACM (2011)","DOI":"10.1145\/1967654.1967669"},{"key":"977_CR21","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2012.10.059","volume":"471","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Johannsen, D., K\u00f6tzing, T., Neumann, F., Theile, M.: More effective crossover operators for the all-pairs shortest path problem. Theor. Comput. Sci. 471, 12\u201326 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"977_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276, 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"977_CR23","doi-asserted-by":"crossref","unstructured":"Doerr, B., K\u00f6tzing, T.: Lower bounds from fitness levels made easy. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1142\u20131150. ACM (2021)","DOI":"10.1145\/3449639.3459352"},{"key":"977_CR24","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1162\/evco_a_00293","volume":"29","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Krejca, M.S.: The univariate marginal distribution algorithm copes well with deception and epistasis. Evol. Comput. 29, 543\u2013563 (2021)","journal-title":"Evol. Comput."},{"key":"977_CR25","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 777\u2013784. ACM (2017)","DOI":"10.1145\/3071178.3071301"},{"key":"977_CR26","doi-asserted-by":"crossref","unstructured":"Doerr, B., Neumann, F. (eds).: Theory of Evolutionary Computation\u2014Recent Developments in Discrete Optimization. Springer (2020). https:\/\/cs.adelaide.edu.au\/frank\/papers\/TheoryBook2019-selfarchived.pdf","DOI":"10.1007\/978-3-030-29414-4"},{"key":"977_CR27","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2018.09.024","volume":"773","author":"B Doerr","year":"2019","unstructured":"Doerr, B.: Analyzing randomized search heuristics via stochastic domination. Theor. Comput. Sci. 773, 115\u2013137 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"977_CR28","doi-asserted-by":"crossref","unstructured":"Doerr, B.: Does comma selection help to cope with local optima? In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1304\u20131313. ACM (2020)","DOI":"10.1145\/3377930.3389823"},{"key":"977_CR29","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1007\/s00453-020-00780-w","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B.: The runtime of the compact genetic algorithm on Jump functions. Algorithmica 83, 3059\u20133107 (2021)","journal-title":"Algorithmica"},{"key":"977_CR30","doi-asserted-by":"crossref","unstructured":"Doerr, B., Rajabi, A.: Stagnation detection meets fast mutation. In: Evolutionary Computation in Combinatorial Optimization, EvoCOP 2022, pp. 191\u2013207. Springer (2022)","DOI":"10.1007\/978-3-031-04148-8_13"},{"key":"977_CR31","doi-asserted-by":"crossref","unstructured":"Doerr, B., Zheng, W.: Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives. In: Conference on Artificial Intelligence, AAAI 2021, pp. 12293\u201312301. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i14.17459"},{"key":"977_CR32","doi-asserted-by":"crossref","unstructured":"Friedrich, T., G\u00f6bel, A., Quinzan, F., Wagner, M.: Heavy-tailed mutation operators in single-objective combinatorial optimization. In: Parallel Problem Solving from Nature, PPSN 2018, Part I, pp. 134\u2013145. Springer (2018)","DOI":"10.1007\/978-3-319-99253-2_11"},{"key":"977_CR33","doi-asserted-by":"crossref","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Nallaperuma, S., Neumann, F., Schirneck, M.: Fast building block assembly by majority vote crossover. In: Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 661\u2013668. ACM (2016)","DOI":"10.1145\/2908812.2908884"},{"key":"977_CR34","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1162\/evco.2009.17.4.17401","volume":"17","author":"T Friedrich","year":"2009","unstructured":"Friedrich, T., Oliveto, P.S., Sudholt, D., Witt, C.: Analysis of diversity-preserving mechanisms for global exploration. Evol. Comput. 17, 455\u2013476 (2009)","journal-title":"Evol. Comput."},{"key":"977_CR35","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Quinzan, F., Wagner, M.: Escaping large deceptive basins of attraction with heavy-tailed mutation operators. In: Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 293\u2013300. ACM (2018)","DOI":"10.1145\/3205455.3205515"},{"key":"977_CR36","doi-asserted-by":"crossref","unstructured":"Fischer, S., Wegener, I.: The Ising model on the ring: mutation versus recombination. In: Genetic and Evolutionary Computation, GECCO 2004, pp. 1113\u20131124. Springer (2004)","DOI":"10.1007\/978-3-540-24854-5_109"},{"key":"977_CR37","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J Garnier","year":"1999","unstructured":"Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evol. Comput. 7, 173\u2013203 (1999)","journal-title":"Evol. Comput."},{"key":"977_CR38","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s00453-016-0214-z","volume":"78","author":"C Gie\u00dfen","year":"2017","unstructured":"Gie\u00dfen, C., Witt, C.: The interplay of population size and mutation probability in the $${(1 + \\lambda )}$$ EA on OneMax. Algorithmica 78, 587\u2013609 (2017)","journal-title":"Algorithmica"},{"key":"977_CR39","doi-asserted-by":"crossref","unstructured":"Hasen\u00f6hrl, V., Sutton, A.M.: On the runtime dynamics of the compact genetic algorithm on jump functions. In: Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 967\u2013974. ACM (2018)","DOI":"10.1145\/3205455.3205608"},{"key":"977_CR40","doi-asserted-by":"crossref","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms\u2014The Computer Science Perspective. Springer (2013)","DOI":"10.1007\/978-3-642-17339-4"},{"key":"977_CR41","doi-asserted-by":"crossref","unstructured":"Jansen, T.: On the black-box complexity of example functions: the real jump function. In: Foundations of Genetic Algorithms, FOGA 2015, pp. 16\u201324. ACM (2015)","DOI":"10.1145\/2725494.2725507"},{"key":"977_CR42","doi-asserted-by":"crossref","unstructured":"J\u00e4gersk\u00fcpper, J., Storch, T.: When the plus strategy outperforms the comma strategy and when not. In: Foundations of Computational Intelligence, FOCI 2007, pp. 25\u201332. IEEE (2007)","DOI":"10.1109\/FOCI.2007.372143"},{"key":"977_CR43","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-002-0940-2","volume":"34","author":"T Jansen","year":"2002","unstructured":"Jansen, T., Wegener, I.: The analysis of evolutionary algorithms\u2014a proof that crossover really can help. Algorithmica 34, 47\u201366 (2002)","journal-title":"Algorithmica"},{"key":"977_CR44","doi-asserted-by":"crossref","unstructured":"Lehre, P.K.: Negative drift in populations. In: Parallel Problem Solving from Nature, PPSN 2010, pp. 244\u2013253. Springer (2010)","DOI":"10.1007\/978-3-642-15844-5_25"},{"key":"977_CR45","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Nguyen, P.T.H.: On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help. In: Foundations of Genetic Algorithms, FOGA 2019, pp. 154\u2013168. ACM (2019)","DOI":"10.1145\/3299904.3340316"},{"key":"977_CR46","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Oliveto, P.S.: Theoretical analysis of stochastic search algorithms. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds), Handbook of Heuristics, pp. 849\u2013884. Springer (2018)","DOI":"10.1007\/978-3-319-07124-4_35"},{"key":"977_CR47","doi-asserted-by":"crossref","unstructured":"Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: On the time complexity of algorithm selection hyper-heuristics for multimodal optimisation. In: Conference on Artificial Intelligence, AAAI 2019, pp. 2322\u20132329. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33012322"},{"key":"977_CR48","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1007\/s00500-010-0610-2","volume":"15","author":"Per Kristian Lehre and Xin Yao","year":"2011","unstructured":"Per Kristian Lehre and Xin Yao: Crossover can be constructive when computing unique input-output sequences. Soft. Comput. 15, 1675\u20131687 (2011)","journal-title":"Soft. Comput."},{"key":"977_CR49","doi-asserted-by":"crossref","unstructured":"Mironovich, V., Buzdalov, M.: Evaluation of heavy-tailed mutation operator on maximum flow test generation problem. In: Genetic and Evolutionary Computation Conference, GECCO 2017, Companion Material, pp. 1423\u20131426. ACM (2017)","DOI":"10.1145\/3067695.3082507"},{"key":"977_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103345","volume":"287","author":"PTH Nguyen","year":"2020","unstructured":"Nguyen, P.T.H., Sudholt, D.: Memetic algorithms outperform evolutionary algorithms in multimodal optimisation. Artif. Intell. 287, 103345 (2020)","journal-title":"Artif. Intell."},{"key":"977_CR51","doi-asserted-by":"crossref","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization\u2014Algorithms and Their Computational Complexity. Springer (2010)","DOI":"10.1007\/978-3-642-16544-3"},{"key":"977_CR52","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., Paix\u00e3o, T., P\u00e9rez Heredia, J., Sudholt, D., Trubenov\u00e1, B.: How to escape local optima in black box optimisation: when non-elitism outperforms elitism. Algorithmica 80, 1604\u20131633 (2018)","DOI":"10.1007\/s00453-017-0369-2"},{"key":"977_CR53","doi-asserted-by":"crossref","unstructured":"Osuna, E.C., Sudholt, D.: Runtime analysis of crowding mechanisms for multimodal optimization. IEEE Trans. Evol. Comput. 24, 581\u2013592 (2020)","DOI":"10.1109\/TEVC.2019.2914606"},{"key":"977_CR54","doi-asserted-by":"crossref","unstructured":"Paix\u00e3o, T., P\u00e9rez Heredia, J., Sudholt, D., Trubenov\u00e1, B.: Towards a runtime comparison of natural and artificial evolution. Algorithmica 78:681\u2013713 (2017)","DOI":"10.1007\/s00453-016-0212-1"},{"key":"977_CR55","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2004.03.038","volume":"320","author":"A Pr\u00fcgel-Bennett","year":"2004","unstructured":"Pr\u00fcgel-Bennett, A.: When a genetic algorithm outperforms hill-climbing. Theor. Comput. Sci. 320, 135\u2013153 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"977_CR56","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s11047-021-09841-7","volume":"20","author":"F Quinzan","year":"2021","unstructured":"Quinzan, F., G\u00f6bel, A., Wagner, M., Friedrich, T.: Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations. Nat. Comput. 20, 561\u2013575 (2021)","journal-title":"Nat. Comput."},{"key":"977_CR57","doi-asserted-by":"crossref","unstructured":"Rowe, J.E.: The benefits and limitations of voting mechanisms in evolutionary optimisation. In: Foundations of Genetic Algorithms, FOGA 2019, pp. 34\u201342. ACM (2019)","DOI":"10.1145\/3299904.3340305"},{"key":"977_CR58","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Self-adjusting evolutionary algorithms for multimodal optimization. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1314\u20131322. ACM (2020)","DOI":"10.1145\/3377930.3389833"},{"key":"977_CR59","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Stagnation detection in highly multimodal fitness landscapes. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1178\u20131186. ACM (2021)","DOI":"10.1145\/3449639.3459336"},{"key":"977_CR60","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Stagnation detection with randomized local search. In: Evolutionary Computation in Combinatorial Optimization, EvoCOP 2021, pp. 152\u2013168. Springer (2021)","DOI":"10.1007\/978-3-030-72904-2_10"},{"key":"977_CR61","doi-asserted-by":"crossref","unstructured":"Sudholt, D.: Crossover is provably essential for the Ising model on trees. In: Genetic and Evolutionary Computation Conference, GECCO 2005, pp. 1161\u20131167. ACM (2005)","DOI":"10.1145\/1068009.1068202"},{"key":"977_CR62","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TEVC.2012.2202241","volume":"17","author":"D Sudholt","year":"2013","unstructured":"Sudholt, D.: A new method for lower bounds on the running time of evolutionary algorithms. IEEE Trans. Evol. Comput. 17, 418\u2013435 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"977_CR63","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1162\/EVCO_a_00171","volume":"25","author":"D Sudholt","year":"2017","unstructured":"Sudholt, D.: How crossover speeds up building block assembly in genetic algorithms. Evol. Comput. 25, 237\u2013274 (2017)","journal-title":"Evol. Comput."},{"key":"977_CR64","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Theoretical aspects of evolutionary algorithms. In: Automata, Languages and Programming, ICALP 2001, pp. 64\u201378. Springer (2001)","DOI":"10.1007\/3-540-48224-5_6"},{"key":"977_CR65","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1017\/S0963548312000600","volume":"22","author":"C Witt","year":"2013","unstructured":"Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear functions. Combin. Probab. Comput. 22, 294\u2013318 (2013)","journal-title":"Combin. Probab. Comput."},{"key":"977_CR66","doi-asserted-by":"crossref","unstructured":"Wu, M., Qian, C., Tang, K.: Dynamic mutation based Pareto optimization for subset selection. In: Intelligent Computing Methodologies, ICIC 2018, Part III, pp. 25\u201335. Springer (2018)","DOI":"10.1007\/978-3-319-95957-3_4"},{"key":"977_CR67","doi-asserted-by":"crossref","unstructured":"Whitley, D., Varadarajan, S., Hirsch, R., Mukhopadhyay, A.: Exploration and exploitation without mutation: solving the jump function in $${\\Theta (n)}$$ time. In: Parallel Problem Solving from Nature, PPSN 2018, Part II, pp. 55\u201366. Springer (2018)","DOI":"10.1007\/978-3-319-99259-4_5"},{"key":"977_CR68","doi-asserted-by":"crossref","unstructured":"Wang, S., Zheng, W., Doerr, B.: Choosing the right algorithm with hints from complexity theory. In: International Joint Conference on Artificial Intelligence, IJCAI 2021, pp. 1697\u20131703 (2021)","DOI":"10.24963\/ijcai.2021\/234"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00977-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-00977-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00977-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T19:10:15Z","timestamp":1727291415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-00977-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,23]]},"references-count":68,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["977"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-00977-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2022,5,23]]},"assertion":[{"value":"27 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}