{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:35:04Z","timestamp":1759847704547,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T00:00:00Z","timestamp":1530576000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["FR 2988 (TOSU)"],"award-info":[{"award-number":["FR 2988 (TOSU)"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007493","name":"Fondation Math\u00e9matique Jacques Hadamard","doi-asserted-by":"publisher","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}],"id":[{"id":"10.13039\/501100007493","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Gaspard Monge Program for Optimization and Operations Research"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00453-018-0477-7","type":"journal-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T11:05:59Z","timestamp":1530615959000},"page":"703-748","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Solving Problems with Unknown Solution Length at Almost No Extra Cost"],"prefix":"10.1007","volume":"81","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,3]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B., Fang, J., Hetet, T.: Runtime analysis for the \n                    \n                      \n                    \n                    $$(\\mu +\\lambda )$$\n                    \n                      \n                        \n                          (\n                          \u03bc\n                          +\n                          \u03bb\n                          )\n                        \n                      \n                    \n                   EA optimizing OneMax. In: Genetic and Evolutionary Computation Conference (GECCO\u201918). ACM (2018) (to appear)","key":"477_CR1","DOI":"10.1145\/3205455.3205627"},{"key":"477_CR2","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1080\/07468342.1997.11973879","volume":"28","author":"JM Ash","year":"1997","unstructured":"Ash, J.M.: Neither a worst convergent series nor a best divergent series exists. Coll. Math. J. 28, 296\u2013297 (1997)","journal-title":"Coll. Math. J."},{"key":"477_CR3","doi-asserted-by":"publisher","DOI":"10.1142\/7438","volume-title":"Theory of Randomized Search Heuristics","author":"A Auger","year":"2011","unstructured":"Auger, A., Doerr, B.: Theory of Randomized Search Heuristics. World Scientific, Singapore (2011)"},{"key":"477_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11047-008-9098-4","volume":"8","author":"L Bianchi","year":"2009","unstructured":"Bianchi, L., Dorigo, M., Gambardella, L., Gutjahr, W.: A survey on metaheuristics for stochastic combinatorial optimization. Nat. Comput. 8, 239\u2013287 (2009)","journal-title":"Nat. Comput."},{"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), pp. 1\u201310. Springer, Berlin (2010)","key":"477_CR5","DOI":"10.1007\/978-3-642-15844-5_1"},{"doi-asserted-by":"crossref","unstructured":"Cathabard, S., Lehre, P.K., Yao, X.: Non-uniform mutation rates for problems with unknown solution lengths. In: Proceedings of Foundations of Genetic Algorithms (FOGA\u201911), pp. 173\u2013180. ACM (2011)","key":"477_CR6","DOI":"10.1145\/1967654.1967670"},{"key":"477_CR7","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1017\/S0963548309990599","volume":"19","author":"M Dietzfelbinger","year":"2010","unstructured":"Dietzfelbinger, M., Rowe, J.E., Wegener, I., Woelfel, P.: Tight bounds for blind search on the integers and the reals. Comb. Probab. Comput. 19, 711\u2013728 (2010)","journal-title":"Comb. Probab. Comput."},{"unstructured":"Doerr, B.: Better runtime guarantees via stochastic domination. CoRR abs\/1801.04487 (2018). \n                    http:\/\/arxiv.org\/abs\/1801.04487","key":"477_CR8"},{"unstructured":"Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. CoRR abs\/1801.06733 (2018). \n                    http:\/\/arxiv.org\/abs\/1801.06733","key":"477_CR9"},{"key":"477_CR10","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 \n                    \n                      \n                    \n                    $$(1+(\\lambda,\\lambda ))$$\n                    \n                      \n                        \n                          (\n                          1\n                          +\n                          (\n                          \u03bb\n                          ,\n                          \u03bb\n                          )\n                          )\n                        \n                      \n                    \n                   genetic algorithm. Algorithmica 80, 1658\u20131709 (2018)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Solving problems with unknown solution length at (almost) no extra cost. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201915), pp. 831\u2013838. ACM (2015)","key":"477_CR11","DOI":"10.1145\/2739480.2754681"},{"doi-asserted-by":"crossref","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)","key":"477_CR12","DOI":"10.1145\/2908812.2908891"},{"doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Unknown solution length problems with no asymptotically optimal run time. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201917), pp. 1367\u20131374. ACM (2017)","key":"477_CR13","DOI":"10.1145\/3071178.3071233"},{"doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Witt, C.: Quasirandom evolutionary algorithms. In: Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference (GECCO\u201910), pp. 1457\u20131464. ACM (2010)","key":"477_CR14","DOI":"10.1145\/1830483.1830749"},{"doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Witt, C.: Sharp bounds by probability-generating functions and variable drift. In: Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference (GECCO\u201911), pp. 2083\u20132090. ACM (2011)","key":"477_CR15","DOI":"10.1145\/2001576.2001856"},{"doi-asserted-by":"crossref","unstructured":"Doerr, B., Jansen, T., Witt, C., Zarges, C.: A method to derive fixed budget results from expected optimisation times. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201913), pp. 1581\u20131588. ACM (2013)","key":"477_CR16","DOI":"10.1145\/2463372.2463565"},{"key":"477_CR17","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":"477_CR18","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+\n                    \n                      \n                    \n                    $$\\lambda $$\n                    \n                      \n                        \u03bb\n                      \n                    \n                  ) evolutionary algorithm\u2013different asymptotic runtimes for different instances. Theor. Comput. Sci. 561, 3\u201323 (2015)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201917), pp. 777\u2013784. ACM (2017)","key":"477_CR19","DOI":"10.1145\/3071178.3071301"},{"key":"477_CR20","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":"477_CR21","volume-title":"Orders of Infinity","author":"GH Hardy","year":"1910","unstructured":"Hardy, G.H.: Orders of Infinity. Cambridge University Press, Cambridge (1910)"},{"key":"477_CR22","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1162\/evco_a_00212","volume":"26","author":"H Hwang","year":"2018","unstructured":"Hwang, H., Panholzer, A., Rolin, N., Tsai, T., Chen, W.: Probabilistic analysis of the (1+1)-evolutionary algorithm. Evol. Comput. 26, 299\u2013345 (2018)","journal-title":"Evol. Comput."},{"key":"477_CR23","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":"477_CR24","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":"477_CR25","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TEVC.2005.846356","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin, Y., Branke, J.: Evolutionary optimization in uncertain environments\u2014a survey. IEEE Trans. Evol. Comput. 9, 303\u2013317 (2005)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"477_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1239\/jap\/1110381369","volume":"42","author":"V Ladret","year":"2005","unstructured":"Ladret, V.: Asymptotic hitting time for a simple evolutionary model of protein folding. J. Appl. Probab. 42, 39\u201351 (2005)","journal-title":"J. Appl. Probab."},{"key":"477_CR27","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.ins.2010.01.031","volume":"259","author":"PK Lehre","year":"2014","unstructured":"Lehre, P.K., Yao, X.: Runtime analysis of the (1 + 1) EA on computing unique input output sequences. Inf. Sci. 259, 510\u2013531 (2014)","journal-title":"Inf. Sci."},{"key":"477_CR28","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":"477_CR29","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":"477_CR30","first-page":"65","volume":"14","author":"C Witt","year":"2006","unstructured":"Witt, C.: Runtime analysis of the (\n                    \n                      \n                    \n                    $$\\mu $$\n                    \n                      \n                        \u03bc\n                      \n                    \n                   + 1) EA on simple pseudo-Boolean functions. Evol. Comput. 14, 65\u201386 (2006)","journal-title":"Evol. Comput."},{"key":"477_CR31","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":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0477-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0477-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0477-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T18:38:51Z","timestamp":1569091131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0477-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["477"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0477-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2018,7,3]]},"assertion":[{"value":"8 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}