{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T02:17:41Z","timestamp":1783995461261,"version":"3.55.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T00:00:00Z","timestamp":1502064000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"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":[[2018,5]]},"DOI":"10.1007\/s00453-017-0354-9","type":"journal-article","created":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T14:12:28Z","timestamp":1502115148000},"page":"1658-1709","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":105,"title":["Optimal Static and Self-Adjusting Parameter Choices for the $$(1+(\\lambda ,\\lambda ))$$ ( 1 + ( \u03bb , \u03bb ) ) Genetic Algorithm"],"prefix":"10.1007","volume":"80","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,8,7]]},"reference":[{"key":"354_CR1","doi-asserted-by":"crossref","unstructured":"Anil, G., Wiegand, R.P.: Black-box search by elimination of fitness functions. In: Proceedings of Foundations of Genetic Algorithms (FOGA\u201909), pp. 67\u201378. ACM (2009)","DOI":"10.1145\/1527125.1527135"},{"key":"354_CR2","doi-asserted-by":"crossref","unstructured":"Auger, A.: Benchmarking the (1+1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201909), (Companion), pp. 2447\u20132452. ACM (2009)","DOI":"10.1145\/1570256.1570342"},{"key":"354_CR3","unstructured":"Auger, A., Hansen, N.: Linear Convergence on Positively Homogeneous Functions of a Comparison Based Step-size Adaptive Randomized Search: The (1+1) ES with Generalized One-fifth Success Rule (2013). http:\/\/arxiv.org\/abs\/1310.8397"},{"key":"354_CR4","doi-asserted-by":"crossref","unstructured":"Badkobeh, G., Lehre, P.K., Sudholt, D.: Unbiased black-box complexity of parallel search. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201914), Lecture Notes in Computer Science, vol. 8672, pp. 892\u2013901. Springer (2014)","DOI":"10.1007\/978-3-319-10762-2_88"},{"key":"354_CR5","doi-asserted-by":"crossref","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201910), Lecture Notes in Computer Science, vol. 6238, pp. 1\u201310. Springer (2010)","DOI":"10.1007\/978-3-642-15844-5_1"},{"key":"354_CR6","doi-asserted-by":"crossref","unstructured":"Dang, D., Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Lehre, P.K., Oliveto, P.S., Sudholt, D., Sutton, A.M.: Emergence of diversity and its benefits for crossover in genetic algorithms. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201916), Lecture Notes in Computer Science, vol. 9921, pp. 890\u2013900. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_83"},{"key":"354_CR7","doi-asserted-by":"crossref","unstructured":"Dang, D., 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: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201916), pp. 645\u2013652. ACM (2016)","DOI":"10.1145\/2908812.2908956"},{"key":"354_CR8","doi-asserted-by":"crossref","unstructured":"Dang, D.C., Lehre, P.K.: Self-adaptation of mutation rates in non-elitist populations. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201916), Lecture Notes in Computer Science, vol. 9921, pp. 803\u2013813. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_75"},{"key":"354_CR9","unstructured":"De\u00a0Jong, K.A.: An analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, Ann Arbor, MI, USA (1975)"},{"key":"354_CR10","unstructured":"Devroye, L.: The compound random search. Ph.D. dissertation, Purdue University, West Lafayette, IN (1972)"},{"key":"354_CR11","unstructured":"Doerr, B.: Analyzing randomized search heuristics: tools from probability theory. In: Auger, A., Doerr, B. (eds.) Theory of Randomized Search Heuristics, pp. 1\u201320. World Scientific Publishing (2011). http:\/\/www.worldscientific.com\/doi\/suppl\/10.1142\/7438\/suppl_file\/7438_chap01.pdf"},{"key":"354_CR12","doi-asserted-by":"crossref","unstructured":"Doerr, B.: Optimal parameter settings for the $$(1+(\\lambda , \\lambda ))$$ ( 1 + ( \u03bb , \u03bb ) ) genetic algorithm. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201916), pp. 1107\u20131114. ACM (2016)","DOI":"10.1145\/2908812.2908885"},{"key":"354_CR13","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: Optimal parameter choices through self-adjustment: Applying the 1\/5-th rule in discrete settings. In: Proceedigns of Genetic and Evolutionary Computation Conference (GECCO\u201915), pp. 1335\u20131342. ACM (2015)","DOI":"10.1145\/2739480.2754684"},{"key":"354_CR14","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: A tight runtime analysis of the (1+( $$\\lambda $$ \u03bb , $$\\lambda $$ \u03bb )) genetic algorithm on OneMax. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201915), pp. 1423\u20131430. ACM (2015)","DOI":"10.1145\/2739480.2754683"},{"key":"354_CR15","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Ebel, F.: Lessons from the black-box: Fast crossover-based genetic algorithms. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201913), pp. 781\u2013788. ACM (2013)","DOI":"10.1145\/2463372.2463480"},{"key":"354_CR16","doi-asserted-by":"crossref","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":"354_CR17","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Provably optimal self-adjusting step sizes for multi-valued decision variables. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201916), Lecture Notes in Computer Science, vol. 9921, pp. 782\u2013791. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_73"},{"key":"354_CR18","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: The right mutation strength for multi-valued decision variables. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201916), pp. 1115\u20131122. ACM (2016). http:\/\/arxiv.org\/abs\/1604.03277"},{"key":"354_CR19","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Yang, J.: $$k$$ k -bit mutation with self-adjusting $$k$$ k outperforms standard bit mutation. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201916), Lecture Notes in Computer Science, vol. 9921, pp. 824\u2013834. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_77"},{"key":"354_CR20","doi-asserted-by":"crossref","unstructured":"Doerr, B., Goldberg, L.A.: Drift analysis with tail bounds. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201910), Lecture Notes in Computer Science, vol. 6238, pp. 174\u2013183. Springer (2010)","DOI":"10.1007\/978-3-642-15844-5_18"},{"key":"354_CR21","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s00453-011-9585-3","volume":"65","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Goldberg, L.A.: Adaptive drift analysis. Algorithmica 65, 224\u2013250 (2013)","journal-title":"Algorithmica"},{"key":"354_CR22","doi-asserted-by":"crossref","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":"354_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/EVCO_a_00055","volume":"21","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Jansen, T., Sudholt, D., Winzen, C., Zarges, C.: Mutation rate matters even when optimizing monotonic functions. Evol. Comput. 21, 1\u201327 (2013)","journal-title":"Evol. Comput."},{"key":"354_CR24","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: Proceedings of Foundations of Genetic Algorithms (FOGA\u201911), pp. 163\u2013172. ACM (2011)","DOI":"10.1145\/1967654.1967669"},{"key":"354_CR25","doi-asserted-by":"crossref","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":"354_CR26","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64, 673\u2013697 (2012)","journal-title":"Algorithmica"},{"key":"354_CR27","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2014.03.015","volume":"561","author":"B Doerr","year":"2015","unstructured":"Doerr, B., K\u00fcnnemann, M.: Optimizing linear functions with the (1+ $$\\lambda $$ \u03bb ) evolutionary algorithm-different asymptotic runtimes for different instances. Theor. Comput. Sci. 561, 3\u201323 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"354_CR28","doi-asserted-by":"crossref","unstructured":"Doerr, B., Theile, M.: Improved analysis methods for crossover-based algorithms. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201909), pp. 247\u2013254. ACM (2009)","DOI":"10.1145\/1569901.1569937"},{"key":"354_CR29","doi-asserted-by":"crossref","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":"354_CR30","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s00224-004-1177-z","volume":"39","author":"S Droste","year":"2006","unstructured":"Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Theory Comput. Syst. 39, 525\u2013544 (2006)","journal-title":"Theory Comput. Syst."},{"key":"354_CR31","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Trans. Evol. Comput. 3, 124\u2013141 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"354_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2003","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Berlin (2003)"},{"key":"354_CR33","first-page":"229","volume":"8","author":"P Erd\u0151s","year":"1963","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On two problems of information theory. Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet K\u00f6zlem\u00e9nyei 8, 229\u2013243 (1963)","journal-title":"Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet K\u00f6zlem\u00e9nyei"},{"key":"354_CR34","doi-asserted-by":"crossref","unstructured":"Fischer, S., Wegener, I.: The Ising model on the ring: mutation versus recombination. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201904), Lecture Notes in Computer Science, vol. 3102, pp. 1113\u20131124. Springer (2004)","DOI":"10.1007\/978-3-540-24854-5_109"},{"key":"354_CR35","doi-asserted-by":"crossref","unstructured":"Gie\u00dfen, C., Witt, C.: Population size vs. mutation strength for the (1+ $$\\lambda $$ \u03bb ) EA on OneMax. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201915), pp. 1439\u20131446. ACM (2015)","DOI":"10.1145\/2739480.2754738"},{"key":"354_CR36","doi-asserted-by":"crossref","unstructured":"Goldman, B.W., Punch, W.F.: Parameter-less population pyramid. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201914), pp. 785\u2013792. ACM (2014)","DOI":"10.1145\/2576768.2598350"},{"key":"354_CR37","doi-asserted-by":"crossref","unstructured":"Hansen, N., Gawelczyk, A., Ostermeier, A.: Sizing the population with respect to the local progress in (1, $$ \\lambda $$ \u03bb )-evolution strategies\u2014a theoretical analysis. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u201995), pp. 80\u201385. IEEE (1995)","DOI":"10.1109\/ICEC.1995.489123"},{"key":"354_CR38","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127, 57\u201385 (2001)","journal-title":"Artif. Intell."},{"key":"354_CR39","doi-asserted-by":"crossref","unstructured":"J\u00e4gersk\u00fcpper, J.: Rigorous runtime analysis of the (1+1) ES: 1\/5-rule and ellipsoidal fitness landscapes. In: Proceedings of Foundations of Genetic Algorithms (FOGA\u201905), Lecture Notes in Computer Science, vol. 3469, pp. 260\u2013281. Springer (2005)","DOI":"10.1007\/11513575_14"},{"key":"354_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms: The Computer Science Perspective","author":"T Jansen","year":"2013","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms: The Computer Science Perspective. Springer, Berlin (2013)"},{"key":"354_CR41","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1162\/106365605774666921","volume":"13","author":"T Jansen","year":"2005","unstructured":"Jansen, T., De Jong, K.A., Wegener, I.: On the choice of the offspring population size in evolutionary algorithms. Evol. Comput. 13, 413\u2013440 (2005)","journal-title":"Evol. Comput."},{"key":"354_CR42","doi-asserted-by":"crossref","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\u2013a proof that crossover really can help. Algorithmica 34, 47\u201366 (2002)","journal-title":"Algorithmica"},{"key":"354_CR43","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.jda.2005.01.002","volume":"4","author":"T Jansen","year":"2006","unstructured":"Jansen, T., Wegener, I.: On the analysis of a dynamic evolutionary algorithm. J. Discrete Algorithms 4, 181\u2013199 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"354_CR44","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/TEVC.2014.2308294","volume":"19","author":"G Karafotias","year":"2015","unstructured":"Karafotias, G., Hoogendoorn, M., Eiben, A.: Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans. Evol. Comput. 19, 167\u2013187 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"354_CR45","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1023\/B:NACO.0000023416.59689.4e","volume":"3","author":"S Kern","year":"2004","unstructured":"Kern, S., M\u00fcller, S.D., Hansen, N., B\u00fcche, D., Ocenasek, J., Koumoutsakos, P.: Learning probability distributions in continuous evolutionary algorithms\u2013a comparative review. Nat. Comput. 3, 77\u2013112 (2004)","journal-title":"Nat. Comput."},{"key":"354_CR46","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T.: Concentration of first hitting times under additive drift. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201914), pp. 1391\u20131398. ACM (2014)","DOI":"10.1145\/2576768.2598364"},{"key":"354_CR47","doi-asserted-by":"crossref","unstructured":"L\u00e4ssig, J., Sudholt, D.: Adaptive population models for offspring populations and parallel evolutionary algorithms. In: Proceedings of Foundations of Genetic Algorithms (FOGA\u201911), pp. 181\u2013192. ACM (2011)","DOI":"10.1145\/1967654.1967671"},{"key":"354_CR48","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1007\/s00453-012-9616-8","volume":"64","author":"PK Lehre","year":"2012","unstructured":"Lehre, P.K., Witt, C.: Black-box search by unbiased variation. Algorithmica 64, 623\u2013642 (2012)","journal-title":"Algorithmica"},{"key":"354_CR49","doi-asserted-by":"crossref","unstructured":"Mironovich, V., Buzdalov, M.: Hard test generation for maximum flow algorithms with the fast crossover-based evolutionary algorithm. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201915) (Companion Material), pp. 1229\u20131232. ACM (2015)","DOI":"10.1145\/2739482.2768487"},{"key":"354_CR50","unstructured":"Mitchell, M., Holland, J.H., Forrest, S.: When will a genetic algorithm outperform hill climbing? In: Proceedings of the 7th Neural Information Processing Systems Conference (NIPS\u201993), Advances in Neural Information Processing Systems, vol.\u00a06, pp. 51\u201358. Morgan Kaufmann (1993)"},{"key":"354_CR51","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., Lehre, P.K., Neumann, F.: Theoretical analysis of rank-based mutation\u2014combining exploration and exploitation. In: Proceedings of Congress on Evolutionary Computation (CEC\u201909), pp. 1455\u20131462. IEEE (2009)","DOI":"10.1109\/CEC.2009.4983114"},{"key":"354_CR52","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1142\/9789814282673_0002","volume-title":"Theory of Randomized Search Heuristics","author":"PS Oliveto","year":"2011","unstructured":"Oliveto, P.S., Yao, X.: Runtime analysis of evolutionary algorithms for discrete optimization. In: Auger, A., Doerr, B. (eds.) Theory of Randomized Search Heuristics, pp. 21\u201352. World Scientific Publishing, Singapore (2011)"},{"key":"354_CR53","doi-asserted-by":"crossref","unstructured":"Raab, M., Steger, A.: \u201cBalls into bins\u201d\u2014a simple and tight analysis. In: Proceedings of Randomization and Approximation Techniques in Computer Science (RANDOM\u201998), Lecture Notes in Computer Science, vol. 1518, pp. 159\u2013170. Springer (1998)","DOI":"10.1007\/3-540-49543-6_13"},{"key":"354_CR54","volume-title":"Evolutionsstrategie","author":"I Rechenberg","year":"1973","unstructured":"Rechenberg, I.: Evolutionsstrategie. Friedrich Fromman Verlag (G\u00fcnther Holzboog KG), Stuttgart (1973)"},{"key":"354_CR55","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/TAC.1968.1098903","volume":"13","author":"MA Schumer","year":"1968","unstructured":"Schumer, M.A., Steiglitz, K.: Adaptive step size random search. IEEE Trans. Autom. Control 13, 270\u2013276 (1968)","journal-title":"IEEE Trans. Autom. Control"},{"key":"354_CR56","doi-asserted-by":"crossref","unstructured":"Sudholt, D.: Crossover is provably essential for the Ising model on trees. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201905), pp. 1161\u20131167. ACM Press (2005)","DOI":"10.1145\/1068009.1068202"},{"key":"354_CR57","doi-asserted-by":"crossref","unstructured":"Sudholt, D.: Crossover speeds up building-block assembly. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201912), pp. 689\u2013702. ACM (2012)","DOI":"10.1145\/2330163.2330260"},{"key":"354_CR58","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Theoretical aspects of evolutionary algorithms. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) Proc. of the 28th International Colloquium on Automata, Languages and Programming (ICALP\u201901), Lecture Notes in Computer Science, vol. 2076, pp. 64\u201378. Springer (2001)","DOI":"10.1007\/3-540-48224-5_6"},{"key":"354_CR59","first-page":"349","volume-title":"Evolutionary Optimization","author":"I Wegener","year":"2002","unstructured":"Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In: Sarker, R., Mohammadian, M., Yao, X. (eds.) Evolutionary Optimization, pp. 349\u2013369. Kluwer, Berlin (2002)"},{"key":"354_CR60","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Simulated annealing beats metropolis in combinatorial optimization. In: Proceedings of International Colloquium on Automata, Languages and Programming (ICALP\u201905), Lecture Notes in Computer Science, vol. 3580, pp. 589\u2013601. Springer (2005)","DOI":"10.1007\/11523468_48"},{"key":"354_CR61","doi-asserted-by":"crossref","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. Comb. Probab. Comput. 22, 294\u2013318 (2013)","journal-title":"Comb. Probab. Comput."},{"key":"354_CR62","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ipl.2013.09.013","volume":"114","author":"C Witt","year":"2014","unstructured":"Witt, C.: Fitness levels with tail bounds for the analysis of randomized search heuristics. Inf. Process. Lett. 114, 38\u201341 (2014)","journal-title":"Inf. Process. Lett."},{"key":"354_CR63","doi-asserted-by":"crossref","unstructured":"Zarges, C.: Rigorous runtime analysis of inversely fitness proportional mutation rates. In: Proceedings of Parallel Problem Solving from Nature (PPSN\u201908), Lecture Notes in Computer Science, vol. 5199, pp. 112\u2013122. Springer (2008)","DOI":"10.1007\/978-3-540-87700-4_12"},{"key":"354_CR64","doi-asserted-by":"crossref","unstructured":"Zarges, C.: On the utility of the population size for inversely fitness proportional mutation rates. In: Proceedings of Foundations of Genetic Algorithms (FOGA\u201909), pp. 39\u201346. ACM (2009)","DOI":"10.1145\/1527125.1527132"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0354-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0354-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0354-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T20:53:12Z","timestamp":1750798392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0354-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,7]]},"references-count":64,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["354"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0354-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,7]]}}}