{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T11:37:05Z","timestamp":1778931425740,"version":"3.51.4"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T00:00:00Z","timestamp":1591920000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T00:00:00Z","timestamp":1591920000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Investissement d\u2019avenir","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}]},{"name":"COST Association","award":["CA15140"],"award-info":[{"award-number":["CA15140"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s00453-020-00726-2","type":"journal-article","created":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T04:28:22Z","timestamp":1591936102000},"page":"1012-1053","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Runtime Analysis for Self-adaptive Mutation Rates"],"prefix":"10.1007","volume":"83","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6105-7700","authenticated-orcid":false,"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,12]]},"reference":[{"key":"726_CR1","unstructured":"Akimoto, Y., Auger, A., Glasmachers, T.: Drift theory in continuous search spaces: expected hitting time of the (1 + 1)-ES with 1\/5 success rule. In: Proceedings of GECCO\u00a0\u201918, pp. 801\u2013808. ACM (2018)"},{"key":"726_CR2","volume-title":"Theory of Randomized Search Heuristics","year":"2011","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics. World Scientific Publishing, Singapore (2011)"},{"key":"726_CR3","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B., Fang, J., Hetet, T.: Runtime analysis for the $$(\\mu +\\lambda )$$ EA optimizing OneMax. In: Proceedings of GECCO \u201918, pp. 1459\u20131466. ACM (2018)","DOI":"10.1145\/3205455.3205627"},{"key":"726_CR4","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B., Yang, Q.: The efficiency threshold for the offspring population size of the $${(\\mu ,\\lambda )}$$ EA. In: Proceedings of GECCO \u201919, pp. 1461\u20131469. ACM (2019)","DOI":"10.1145\/3321707.3321838"},{"key":"726_CR5","unstructured":"B\u00e4ck, T.: Self-adaptation in genetic algorithms. In: Proceedings of ECAL \u201992, pp. 263\u2013271. MIT Press (1992)"},{"key":"726_CR6","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 PPSN\u00a0\u201910, pp. 1\u201310. Springer (2010)","DOI":"10.1007\/978-3-642-15844-5_1"},{"key":"726_CR7","first-page":"38","volume":"4","author":"SN Bernstein","year":"1924","unstructured":"Bernstein, S.N.: On a modification of Chebyshev\u2019s inequality and of the error formula of Laplace. Ann. Sci. Inst. Sav. Ukraine, Sect. Math. 1 4, 38\u201349 (1924)","journal-title":"Ann. Sci. Inst. Sav. Ukraine, Sect. Math. 1"},{"key":"726_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00483-4","volume-title":"Tuning Metaheuristics: A Machine Learning Perspective","author":"M Birattari","year":"2009","unstructured":"Birattari, M.: Tuning Metaheuristics: A Machine Learning Perspective. Springer, Berlin (2009)"},{"key":"726_CR9","doi-asserted-by":"crossref","unstructured":"Badkobeh, G., Lehre, P.K., Sudholt, D.: Unbiased black-box complexity of parallel search. In: Proceedings of PPSN\u00a0\u201914, pp. 892\u2013901. Springer (2014)","DOI":"10.1007\/978-3-319-10762-2_88"},{"key":"726_CR10","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/TEVC.2017.2753538","volume":"22","author":"D Corus","year":"2018","unstructured":"Corus, D., Dang, D.-C.D.-C., Eremeev, A.V., Lehre, P.K.: Level-based analysis of genetic algorithms and other search processes. IEEE Trans. Evol. Comput. 22, 707\u2013719 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"726_CR11","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1109\/TSMCB.2008.2012167","volume":"39","author":"T Chen","year":"2009","unstructured":"Chen, T., He, J., Sun, G., Chen, G., Yao, X.: A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems. IEEE Trans. Syst. Man Cybern. Part B 39, 1092\u20131106 (2009)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"726_CR12","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: Proceedings of GECCO\u00a0\u201915, pp. 1335\u20131342. ACM (2015)","DOI":"10.1145\/2739480.2754684"},{"key":"726_CR13","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1007\/s00453-017-0354-9","volume":"80","author":"B Doerr","year":"2018","unstructured":"Doerr, B., Doerr, C.: Optimal static and self-adjusting parameter choices for the $$(1+(\\lambda,\\lambda ))$$ genetic algorithm. Algorithmica 80, 1658\u20131709 (2018)","journal-title":"Algorithmica"},{"key":"726_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-030-29414-4_6","volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Doerr, C.: Theory of parameter control for discrete black-box optimization: provable performance gains through dynamic parameter choices. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 271\u2013321. Springer, Berlin (2020)"},{"key":"726_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 GECCO\u00a0\u201913, pp. 781\u2013788. ACM (2013)","DOI":"10.1145\/2463372.2463480"},{"key":"726_CR16","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 PPSN\u00a0\u201916, pp. 782\u2013791. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_73"},{"key":"726_CR17","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":"726_CR18","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Yang, J.: $$k$$-bit mutation with self-adjusting $$k$$ outperforms standard bit mutation. In: Proceedings of PPSN\u00a0\u201916, pp. 824\u2013834. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_77"},{"key":"726_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2019.06.014","volume":"801","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Doerr, C., Yang, J.: Optimal parameter choices via precise black-box analysis. Theor. Comput. Sci. 801, 1\u201334 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"726_CR20","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Witt, C.: Quasirandom evolutionary algorithms. In: Proceedings of GECCO \u201910, pp. 1457\u20131464. ACM (2010)","DOI":"10.1145\/1830483.1830749"},{"key":"726_CR21","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Witt, C.: Sharp bounds by probability-generating functions and variable drift. In: Proceedings of GECCO \u201911, pp. 2083\u20132090. ACM (2011)","DOI":"10.1145\/2001576.2001856"},{"key":"726_CR22","doi-asserted-by":"publisher","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":"726_CR23","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00453-018-0502-x","volume":"81","author":"B Doerr","year":"2019","unstructured":"Doerr, B., Gie\u00dfen, C., Witt, C., Yang, J.: The $${(1 + \\lambda )}$$ evolutionary algorithm with self-adjusting mutation rate. Algorithmica 81, 593\u2013631 (2019)","journal-title":"Algorithmica"},{"key":"726_CR24","doi-asserted-by":"publisher","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 monotone functions. Evol. Comput. 21, 1\u201321 (2013)","journal-title":"Evol. Comput."},{"key":"726_CR25","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":"726_CR26","doi-asserted-by":"publisher","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":"726_CR27","doi-asserted-by":"publisher","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$$) evolutionary algorithm\u2014different asymptotic runtimes for different instances. Theor. Comput. Sci. 561, 3\u201323 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"726_CR28","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/s00453-015-0103-x","volume":"75","author":"D-C Dang","year":"2016","unstructured":"Dang, D.-C., Lehre, P.K.: Runtime analysis of non-elitist populations: From classical optimisation to partial information. Algorithmica 75, 428\u2013461 (2016)","journal-title":"Algorithmica"},{"key":"726_CR29","doi-asserted-by":"crossref","unstructured":"Dang, D.-C., Lehre, P.K.: Self-adaptation of mutation rates in non-elitist populations. In: Proceedings of PPSN\u00a0\u201916, pp. 803\u2013813. Springer (2016)","DOI":"10.1007\/978-3-319-45823-6_75"},{"key":"726_CR30","doi-asserted-by":"crossref","unstructured":"Doerr, B., Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: On the runtime analysis of selection hyper-heuristics with adaptive learning periods. In: Proceedings of GECCO \u201918, pp. 1015\u20131022. ACM (2018)","DOI":"10.1145\/3205455.3205611"},{"key":"726_CR31","volume-title":"Theory of Evolutionary Computation\u2014Recent Developments in Discrete Optimization","author":"B Doerr","year":"2019","unstructured":"Doerr, B., Neumann, F.: Theory of Evolutionary Computation\u2014Recent Developments in Discrete Optimization. Springer, Berlin (2019)"},{"key":"726_CR32","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.spl.2018.03.016","volume":"139","author":"B Doerr","year":"2018","unstructured":"Doerr, B.: An elementary analysis of the probability that a binomial random variable exceeds its expectation. Stat. Probab. Lett. 139, 67\u201374 (2018)","journal-title":"Stat. Probab. Lett."},{"key":"726_CR33","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":"726_CR34","doi-asserted-by":"crossref","unstructured":"Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 1\u201387. Springer, Berlin (2020). https:\/\/arxiv.org\/abs\/1801.06733","DOI":"10.1007\/978-3-030-29414-4_1"},{"key":"726_CR35","doi-asserted-by":"crossref","unstructured":"Doerr, B., Witt, C., Yang, J.: Runtime analysis for self-adaptive mutation rates. In: Proceedings of GECCO \u201918, pp. 1475\u20131482. ACM (2018)","DOI":"10.1145\/3205455.3205569"},{"key":"726_CR36","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":"726_CR37","doi-asserted-by":"publisher","first-page":"502","DOI":"10.2307\/1426671","volume":"13","author":"B Hajek","year":"1982","unstructured":"Hajek, B.: Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Probab. 13, 502\u2013525 (1982)","journal-title":"Adv. Appl. Probab."},{"key":"726_CR38","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1162\/evco_a_00212","volume":"26","author":"H-K Hwang","year":"2018","unstructured":"Hwang, H.-K., Panholzer, A., Rolin, N., Tsai, T.-H., Chen, W.-M.: Probabilistic analysis of the (1+1)-evolutionary algorithm. Evol. Comput. 26, 299\u2013345 (2018)","journal-title":"Evol. Comput."},{"key":"726_CR39","doi-asserted-by":"crossref","unstructured":"Hwang, H.-K., Witt, C.: Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools. In: Proceedings of FOGA \u201919, pp. 1\u201312. ACM (2019)","DOI":"10.1145\/3299904.3340302"},{"key":"726_CR40","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00453-010-9396-y","volume":"59","author":"J J\u00e4gersk\u00fcpper","year":"2011","unstructured":"J\u00e4gersk\u00fcpper, J.: Combining Markov-chain analysis and drift analysis - the (1+1) evolutionary algorithm on linear functions reloaded. Algorithmica 59, 409\u2013424 (2011)","journal-title":"Algorithmica"},{"key":"726_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms\u2014The Computer Science Perspective","author":"T Jansen","year":"2013","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms\u2014The Computer Science Perspective. Springer, Berlin (2013)"},{"key":"726_CR42","doi-asserted-by":"publisher","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":"726_CR43","unstructured":"Johannsen, D.: Random combinatorial structures and randomized search heuristics. PhD thesis, Saarland University (2010)"},{"key":"726_CR44","doi-asserted-by":"crossref","unstructured":"J\u00e4gersk\u00fcpper, J., Storch, T.: When the plus strategy outperforms the comma strategy\u2014and when not. In: Proceedings of FOCI\u00a0\u201907, pp. 25\u201332. IEEE (2007)","DOI":"10.1109\/FOCI.2007.372143"},{"key":"726_CR45","doi-asserted-by":"publisher","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. Discret. Algorithms 4, 181\u2013199 (2006)","journal-title":"J. Discret. Algorithms"},{"key":"726_CR46","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2014.2308294","volume":"19","author":"G Karafotias","year":"2015","unstructured":"Karafotias, G., Hoogendoorn, M., Eiben, A.E.: Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans. Evol. Comput. 19, 167\u2013187 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"726_CR47","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Lissovoi, A., Witt, C.: (1+1) EA on generalized dynamic OneMax. In: Proceedings of FOGA\u00a0\u201915, pp. 40\u201351. ACM (2015)","DOI":"10.1145\/2725494.2725502"},{"key":"726_CR48","doi-asserted-by":"crossref","unstructured":"Lehre, P.K.: Negative drift in populations. In: Proceedings of PPSN \u201910, pp. 244\u2013253. Springer (2010)","DOI":"10.1007\/978-3-642-15844-5_25"},{"key":"726_CR49","doi-asserted-by":"crossref","unstructured":"L\u00e4ssig, J., Sudholt, D.: Adaptive population models for offspring populations and parallel evolutionary algorithms. In: Proceedings of FOGA\u00a0\u201911, pp. 181\u2013192. ACM (2011)","DOI":"10.1145\/1967654.1967671"},{"key":"726_CR50","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Witt, C.: Concentrated hitting times of randomized search heuristics with variable drift. In: Proceedings\u00a0of ISAAC \u201914, pp. 686\u2013697. Springer (2014)","DOI":"10.1007\/978-3-319-13075-0_54"},{"key":"726_CR51","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Yao, X.: On the impact of mutation\u2013selection balance on the runtime of evolutionary algorithms. IEEE Trans. Evol. Comput. 16, 225\u2013241 (2012)","DOI":"10.1109\/TEVC.2011.2112665"},{"key":"726_CR52","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1108\/17563780910959893","volume":"2","author":"B Mitavskiy","year":"2009","unstructured":"Mitavskiy, B., Rowe, J.E., Cannings, C.: Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links. Int. J. Intell. Comput. Cybern. 2, 243\u2013284 (2009)","journal-title":"Int. J. Intell. Comput. Cybern."},{"key":"726_CR53","unstructured":"M\u00fchlenbein, H.: How genetic algorithms really work: mutation and hillclimbing. In: Proceedings of PPSN \u201992, pp. 15\u201326. Elsevier (1992)"},{"key":"726_CR54","volume-title":"Bioinspired Computation in Combinatorial Optimization\u2014Algorithms and Their Computational Complexity","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization\u2014Algorithms and Their Computational Complexity. Springer, Berlin (2010)"},{"key":"726_CR55","first-page":"26","volume":"62","author":"H Robbins","year":"1955","unstructured":"Robbins, H.: A remark on Stirling\u2019s formula. Am. Math. Mon. 62, 26\u201329 (1955)","journal-title":"Am. Math. Mon."},{"key":"726_CR56","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2018.02.011","volume":"736","author":"JE Rowe","year":"2018","unstructured":"Rowe, J.E.: Linear multi-objective drift analysis. Theor. Comput. Sci. 736, 25\u201340 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"726_CR57","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2013.09.036","volume":"545","author":"JE Rowe","year":"2014","unstructured":"Rowe, J.E., Sudholt, D.: The choice of the offspring population size in the (1, $$\\lambda$$) evolutionary algorithm. Theor. Comput. Sci. 545, 20\u201338 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"726_CR58","doi-asserted-by":"crossref","unstructured":"Smit, S.K., Eiben, A.E.: Beating the \u2018world champion\u2019 evolutionary algorithm via REVAC tuning. In: Proceedings of CEC \u201910, pp. 1\u20138. IEEE Press (2010)","DOI":"10.1109\/CEC.2010.5586026"},{"key":"726_CR59","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":"726_CR60","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Simulated annealing beats Metropolis in combinatorial optimization. In: Proceedings of ICALP \u201905, pp. 589\u2013601. Springer (2005)","DOI":"10.1007\/11523468_48"},{"key":"726_CR61","first-page":"65","volume":"14","author":"C Witt","year":"2006","unstructured":"Witt, C.: Runtime analysis of the ($$\\mu$$ + 1) EA on simple pseudo-Boolean functions. Evol. Comput. 14, 65\u201386 (2006)","journal-title":"Evol. Comput."},{"key":"726_CR62","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. Comb. Probab. Comput. 22, 294\u2013318 (2013)","journal-title":"Comb. Probab. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00726-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00726-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00726-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T23:30:38Z","timestamp":1623454238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00726-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,12]]},"references-count":62,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["726"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00726-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,12]]},"assertion":[{"value":"27 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}