{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:53:48Z","timestamp":1780638828727,"version":"3.54.1"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T00:00:00Z","timestamp":1605225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T00:00:00Z","timestamp":1605225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s00453-020-00780-w","type":"journal-article","created":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T13:03:34Z","timestamp":1605272614000},"page":"3059-3107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["The Runtime of the Compact Genetic Algorithm on Jump Functions"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9786-220X","authenticated-orcid":false,"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,13]]},"reference":[{"key":"780_CR1","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.dam.2019.01.007","volume":"260","author":"P Afshani","year":"2019","unstructured":"Afshani, P., Agrawal, M., Doerr, B., Doerr, C., Larsen, K.G., Mehlhorn, K.: The query complexity of a permutation-based variant of Mastermind. Discrete Appl. Math. 260, 28\u201350 (2019)","journal-title":"Discrete Appl. Math."},{"key":"780_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":"780_CR3","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B.: Precise runtime analysis for plateaus. In: Parallel Problem Solving From Nature, PPSN 2018, Part II, pp. 117\u2013128. Springer, Berlin (2018)","DOI":"10.1007\/978-3-319-99259-4_10"},{"key":"780_CR4","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. Springer, Berlin (2020) (to appear)","DOI":"10.1007\/978-3-030-58115-2_38"},{"key":"780_CR5","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":"780_CR6","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: Genetic and Evolutionary Computation Conference, GECCO 2019, pp. 1461\u20131469. ACM (2019)","DOI":"10.1145\/3321707.3321838"},{"key":"780_CR7","doi-asserted-by":"crossref","unstructured":"Anil, G., Wiegand, R.P.: Black-box search by elimination of fitness functions. In: Foundations of Genetic Algorithms, FOGA 2009, pp. 67\u201378. ACM (2009)","DOI":"10.1145\/1527125.1527135"},{"key":"780_CR8","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1162\/EVCO_a_00185","volume":"24","author":"M Buzdalov","year":"2016","unstructured":"Buzdalov, M., Doerr, B., Kever, M.: The unrestricted black-box complexity of jump functions. Evolut. Comput. 24, 719\u2013744 (2016)","journal-title":"Evolut. Comput."},{"key":"780_CR9","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":"780_CR10","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, Berlin (2018)","DOI":"10.1007\/978-3-319-99259-4_6"},{"key":"780_CR11","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":"780_CR12","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":"780_CR13","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/TEVC.2017.2724201","volume":"22","author":"D-C Dang","year":"2018","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. Evolut. Comput. 22, 484\u2013497 (2018)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"780_CR14","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1162\/EVCO_a_00047","volume":"19","author":"B Doerr","year":"2011","unstructured":"Doerr, B., Happ, E., Klein, C.: Tight analysis of the (1+1)-EA for the single source shortest path problem. Evolut. Comput. 19, 673\u2013691 (2011)","journal-title":"Evolut. Comput."},{"key":"780_CR15","doi-asserted-by":"crossref","unstructured":"Doerr, B., Johannsen, D.: Edge-based representation beats vertex-based representation in shortest path problems. In: Genetic and Evolutionary Computation Conference, GECCO 2010, pp. 759\u2013766. ACM (2010)","DOI":"10.1145\/1830483.1830618"},{"key":"780_CR16","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":"780_CR17","doi-asserted-by":"publisher","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":"780_CR18","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":"780_CR19","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2956633","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Krejca, M.S.: Significance-based estimation-of-distribution algorithms. IEEE Trans. Evolut. Comput. (2020). https:\/\/doi.org\/10.1109\/TEVC.2019.2956633","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"780_CR20","doi-asserted-by":"crossref","unstructured":"Doerr, B., Krejca, M.S.: The univariate marginal distribution algorithm copes well with deception and epistasis. In: Evolutionary Computation in Combinatorial Optimization, EvoCOP 2020, pp. 51\u201366. Springer, Berlin (2020)","DOI":"10.1007\/978-3-030-43680-3_4"},{"key":"780_CR21","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":"780_CR22","volume-title":"Theory of Evolutionary Computation-Recent Developments in Discrete Optimization","year":"2020","unstructured":"Doerr, B., Neumann, F. (eds.): Theory of Evolutionary Computation-Recent Developments in Discrete Optimization. Springer, Berlin (2020)"},{"key":"780_CR23","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":"780_CR24","doi-asserted-by":"crossref","unstructured":"Doerr, B.: An exponential lower bound for the runtime of the compact genetic algorithm on jump functions. In: Foundations of Genetic Algorithms, FOGA 2019, pp. 25\u201333. ACM (2019)","DOI":"10.1145\/3299904.3340304"},{"key":"780_CR25","doi-asserted-by":"crossref","unstructured":"Doerr, B.: A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost. In: Genetic and Evolutionary Computation Conference, GECCO 2019, pp. 1488\u20131496. ACM (2019)","DOI":"10.1145\/3321707.3321747"},{"key":"780_CR26","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":"780_CR27","doi-asserted-by":"crossref","unstructured":"Doerr, B.: Lower bounds for non-elitist evolutionary algorithms via negative multiplicative drift. In: Parallel Problem Solving From Nature, PPSN 2020. Springer, Berlin (2020) (to appear)","DOI":"10.1007\/978-3-030-58115-2_42"},{"key":"780_CR28","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). arXiv:1801.06733","DOI":"10.1007\/978-3-030-29414-4_1"},{"key":"780_CR29","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s11047-006-9001-0","volume":"5","author":"S Droste","year":"2006","unstructured":"Droste, S.: A rigorous analysis of the compact genetic algorithm for linear functions. Nat. Comput. 5, 257\u2013283 (2006)","journal-title":"Nat. Comput."},{"key":"780_CR30","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s00453-012-9684-9","volume":"68","author":"B Doerr","year":"2014","unstructured":"Doerr, B., Winzen, C.: Ranking-based black-box complexity. Algorithmica 68, 571\u2013609 (2014)","journal-title":"Algorithmica"},{"key":"780_CR31","unstructured":"Doerr, B., Zheng, W.: A parameter-less compact genetic algorithm. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 805\u2013813. ACM (2020)"},{"key":"780_CR32","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.2987361","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Zheng, W.: Sharp bounds for genetic drift in estimation-of-distribution algorithms. IEEE Trans. Evolut. Comput. (2020). https:\/\/doi.org\/10.1109\/TEVC.2020.2987361","journal-title":"IEEE Trans. Evolut."},{"key":"780_CR33","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.tcs.2019.08.025","volume":"801","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Zheng, W.: Working principles of binary differential evolution. Theor. Comput. Sci. 801, 110\u2013142 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"780_CR34","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":"780_CR35","first-page":"477","volume":"21","author":"T Friedrich","year":"2017","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Sutton, A.M.: The compact genetic algorithm is efficient under extreme Gaussian noise. IEEE Trans. Evolut. Comput. 21, 477\u2013490 (2017)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"780_CR36","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":"780_CR37","unstructured":"Fajardo, M.A.H., Sudholt, D.: On the choice of the parameter control mechanism in the $$(1+(\\lambda ,\\lambda ))$$ genetic algorithm. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 832\u2013840. ACM (2020)"},{"key":"780_CR38","doi-asserted-by":"crossref","unstructured":"Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: Symposium on Theoretical Aspects of Computer Science, STACS 2003, pp. 415\u2013426. Springer, Berlin (2003)","DOI":"10.1007\/3-540-36494-3_37"},{"key":"780_CR39","unstructured":"Giel, O., Wegener, I.: Searching randomly for maximum matchings. Electronic Colloquium on Computational Complexity (ECCC), (076) (2004)"},{"key":"780_CR40","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":"780_CR41","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"GR Harik","year":"1999","unstructured":"Harik, G.R., Lobo, F.G., Goldberg, D.E.: The compact genetic algorithm. IEEE Trans. Evolut. Comput. 3, 287\u2013297 (1999)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"780_CR42","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"780_CR43","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":"780_CR44","doi-asserted-by":"publisher","first-page":"51","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, 51\u201381 (2001)","journal-title":"Artif. Intell."},{"key":"780_CR45","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":"780_CR46","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. Evolut. Comput. 13, 413\u2013440 (2005)","journal-title":"Evolut. Comput."},{"key":"780_CR47","doi-asserted-by":"crossref","unstructured":"Jansen, T., Oliveto, P.S., Zarges, C.: Approximating vertex cover using edge-based representations. In: Foundations of Genetic Algorithms, FOGA 2013, pp. 87\u201396. ACM (2013)","DOI":"10.1145\/2460239.2460248"},{"key":"780_CR48","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":"780_CR49","doi-asserted-by":"crossref","unstructured":"Krejca, M., Witt, C.: Theory of estimation-of-distribution algorithms. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 405\u2013442. Springer, Berlin (2020). arXiv:1806.05392","DOI":"10.1007\/978-3-030-29414-4_9"},{"key":"780_CR50","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.tcs.2018.06.004","volume":"832","author":"MS Krejca","year":"2020","unstructured":"Krejca, M.S., Witt, C.: Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax. Theor. Comput. Sci. 832, 143\u2013165 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"780_CR51","doi-asserted-by":"crossref","unstructured":"Lengler, J.: Drift analysis. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 89\u2013131. Springer, Berlin (2020). arXiv:1712.00964","DOI":"10.1007\/978-3-030-29414-4_2"},{"key":"780_CR52","volume-title":"Estimation of Distribution Algorithms. Genetic Algorithms and Evolutionary Computation","year":"2002","unstructured":"Larra\u00f1aga, P., Lozano, J.A. (eds.): Estimation of Distribution Algorithms. Genetic Algorithms and Evolutionary Computation. Springer, Berlin (2002)"},{"key":"780_CR53","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Nguyen, P.T.H.: Improved runtime bounds for the univariate marginal distribution algorithm via anti-concentration. In: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 1383\u20131390. ACM (2017)","DOI":"10.1145\/3071178.3071317"},{"key":"780_CR54","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":"780_CR55","doi-asserted-by":"crossref","unstructured":"Lengler, J., Sudholt, D., Witt, C.: Medium step sizes are harmful for the compact genetic algorithm. In: Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 1499\u20131506. ACM (2018)","DOI":"10.1145\/3205455.3205576"},{"key":"780_CR56","doi-asserted-by":"publisher","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":"780_CR57","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":"780_CR58","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TEVC.2009.2014362","volume":"13","author":"PS Oliveto","year":"2009","unstructured":"Oliveto, P.S., He, J., Yao, X.: Analysis of the (1+1)-EA for finding approximate solutions to vertex cover problems. IEEE Trans. Evolut. Comput. 13, 1006\u20131029 (2009)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"780_CR59","unstructured":"Oliveto, P.S., Witt, C.: Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation. CoRR arXiv:1211.7184 (2012)"},{"key":"780_CR60","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/978-3-662-43505-2_45","volume-title":"Springer Handbook of Computational Intelligence","author":"M Pelikan","year":"2015","unstructured":"Pelikan, M., Hauschild, M., Lobo, F.G.: Estimation of distribution algorithms. In: Kacprzyk, J., Pedrycz, W. (eds.) Springer Handbook of Computational Intelligence, pp. 899\u2013928. Springer, Berlin (2015)"},{"key":"780_CR61","doi-asserted-by":"crossref","unstructured":"Rowe, J.E., Aishwaryaprajna.: 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":"780_CR62","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":"780_CR63","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. Evolut. Comput. 17, 418\u2013435 (2013)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"780_CR64","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1007\/s00453-018-0480-z","volume":"81","author":"D Sudholt","year":"2019","unstructured":"Sudholt, D., Witt, C.: On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization. Algorithmica 81, 1450\u20131489 (2019)","journal-title":"Algorithmica"},{"key":"780_CR65","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Simulated annealing beats Metropolis in combinatorial optimization. In: Automata, Languages and Programming, ICALP 2005, pp. 589\u2013601. Springer, Berlin (2005)","DOI":"10.1007\/11523468_48"},{"key":"780_CR66","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."},{"key":"780_CR67","doi-asserted-by":"crossref","unstructured":"Witt, C.: Domino convergence: why one should hill-climb on linear functions. In: Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 1539\u20131546. ACM (2018)","DOI":"10.1145\/3205455.3205581"},{"key":"780_CR68","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/s00453-018-0463-0","volume":"81","author":"C Witt","year":"2019","unstructured":"Witt, C.: Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax. Algorithmica 81, 632\u2013667 (2019)","journal-title":"Algorithmica"},{"key":"780_CR69","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, Berlin (2018)","DOI":"10.1007\/978-3-319-99259-4_5"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00780-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00780-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00780-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T15:35:28Z","timestamp":1633102528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00780-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,13]]},"references-count":69,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["780"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00780-w","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,13]]},"assertion":[{"value":"19 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}