{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:31:24Z","timestamp":1762299084114,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T00:00:00Z","timestamp":1566864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,27]]},"DOI":"10.1145\/3299904.3340315","type":"proceedings-article","created":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T19:43:29Z","timestamp":1566243809000},"page":"147-153","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem"],"prefix":"10.1145","author":[{"given":"Frank","family":"Neumann","sequence":"first","affiliation":[{"name":"The University of Adelaide, Adelaide, SA, Australia"}]},{"given":"Andrew M.","family":"Sutton","sequence":"additional","affiliation":[{"name":"University of Minnesota Duluth"}]}],"member":"320","published-online":{"date-parts":[[2019,8,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Anne Auger and Benjamin Doerr (Eds.). 2011. Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Singapore.   Anne Auger and Benjamin Doerr (Eds.). 2011. Theory of Randomized Search Heuristics: Foundations and Recent Developments . World Scientific Singapore.","DOI":"10.1142\/7438"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.3934\/naco.2012.2.767"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.73"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00178"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3040718.3040728"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0896-z"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1583"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900442"},{"volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"Jansen Thomas","key":"e_1_3_2_1_9_1","unstructured":"Thomas Jansen . 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective . Springer , Berlin . Thomas Jansen. 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer, Berlin."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2008.03.006"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513575_7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2007.05.009"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0098-1354(00)00398-7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.06.035"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-9975-z"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0262-4"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2244898"},{"key":"e_1_3_2_1_18_1","volume-title":"Sutton","author":"Neumann Frank","year":"2018","unstructured":"Frank Neumann and Andrew M . Sutton . 2018 . Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights. In Proceedings of the Fifteenth International Conference on Parallel Problem Solving from Nature (Lecture Notes in Computer Science), Anne Auger, Carlos M. Fonseca, Nuno Louren\u00e7o, Penousal Machado, Lu\u00eds Paquete, and Darrell Whitley (Eds.), Vol. 11102 . Springer , 141--152. Frank Neumann and Andrew M. Sutton. 2018. Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights. In Proceedings of the Fifteenth International Conference on Parallel Problem Solving from Nature (Lecture Notes in Computer Science), Anne Auger, Carlos M. Fonseca, Nuno Louren\u00e7o, Penousal Machado, Lu\u00eds Paquete, and Darrell Whitley (Eds.), Vol. 11102. Springer, 141--152."},{"key":"e_1_3_2_1_19_1","volume-title":"Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity","author":"Neumann Frank","unstructured":"Frank Neumann and Carsten Witt . 2010. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity ( 1 st ed.). Springer , Berlin . Frank Neumann and Carsten Witt. 2010. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (1st ed.). Springer, Berlin.","edition":"1"},{"volume-title":"Randomized algorithms","author":"Raghavan Prabhakar","key":"e_1_3_2_1_20_1","unstructured":"Prabhakar Raghavan and Rajeev Motwani . 1995. Randomized algorithms . Cambridge University Press , Cambridge . Prabhakar Raghavan and Rajeev Motwani. 1995. Randomized algorithms. Cambridge University Press, Cambridge."},{"volume-title":"Proceedings of the Fifteenth International Conference on Parallel Problem Solving from Nature (Lecture Notes in Computer Science), Anne Auger, Carlos M","author":"Roostapour Vahid","key":"e_1_3_2_1_21_1","unstructured":"Vahid Roostapour , Aneta Neumann , and Frank Neumann . 2018. On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem . In Proceedings of the Fifteenth International Conference on Parallel Problem Solving from Nature (Lecture Notes in Computer Science), Anne Auger, Carlos M . Fonseca, Nuno Louren\u00e7o, Penousal Machado, Lu\u00eds Paquete, and Darrell Whitley (Eds.), Vol. 11101 . Springer , Berlin , 158--169. Vahid Roostapour, Aneta Neumann, and Frank Neumann. 2018. On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem. In Proceedings of the Fifteenth International Conference on Parallel Problem Solving from Nature (Lecture Notes in Computer Science), Anne Auger, Carlos M. Fonseca, Nuno Louren\u00e7o, Penousal Machado, Lu\u00eds Paquete, and Darrell Whitley (Eds.), Vol. 11101. Springer, Berlin, 158--169."},{"key":"e_1_3_2_1_22_1","volume-title":"Pareto Optimization for Subset Selection with Dynamic Cost Constraints. CoRR abs\/1811.07806","author":"Roostapour Vahid","year":"2018","unstructured":"Vahid Roostapour , Aneta Neumann , Frank Neumann , and Tobias Friedrich . 2018. Pareto Optimization for Subset Selection with Dynamic Cost Constraints. CoRR abs\/1811.07806 ( 2018 ). arXiv:1811.07806 http:\/\/arxiv.org\/abs\/1811.07806 Conference version appears at AAAI 2019. Vahid Roostapour, Aneta Neumann, Frank Neumann, and Tobias Friedrich. 2018. Pareto Optimization for Subset Selection with Dynamic Cost Constraints. CoRR abs\/1811.07806 (2018). arXiv:1811.07806 http:\/\/arxiv.org\/abs\/1811.07806 Conference version appears at AAAI 2019."},{"key":"e_1_3_2_1_23_1","volume-title":"Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. CoRR abs\/1806.08547","author":"Roostapour Vahid","year":"2018","unstructured":"Vahid Roostapour , Mojgan Pourhassan , and Frank Neumann . 2018. Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. CoRR abs\/1806.08547 ( 2018 ). arXiv:1806.08547 http:\/\/arxiv.org\/abs\/1806.08547 Vahid Roostapour, Mojgan Pourhassan, and Frank Neumann. 2018. Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. CoRR abs\/1806.08547 (2018). arXiv:1806.08547 http:\/\/arxiv.org\/abs\/1806.08547"},{"key":"e_1_3_2_1_24_1","volume-title":"On Cumulative Sums of Random Variables. Ann. Math. Statist. 15, 3 (09","author":"Wald Abraham","year":"1944","unstructured":"Abraham Wald . 1944. On Cumulative Sums of Random Variables. Ann. Math. Statist. 15, 3 (09 1944 ), 283--296. Abraham Wald. 1944. On Cumulative Sums of Random Variables. Ann. Math. Statist. 15, 3 (09 1944), 283--296."},{"key":"e_1_3_2_1_25_1","volume-title":"Some Generalizations of the Theory of Cumulative Sums of Random Variables. Ann. Math. Statist. 16, 3 (09","author":"Wald Abraham","year":"1945","unstructured":"Abraham Wald . 1945. Some Generalizations of the Theory of Cumulative Sums of Random Variables. Ann. Math. Statist. 16, 3 (09 1945 ), 287--293. Abraham Wald. 1945. Some Generalizations of the Theory of Cumulative Sums of Random Variables. Ann. Math. Statist. 16, 3 (09 1945), 287--293."},{"key":"e_1_3_2_1_26_1","volume-title":"Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. CoRR abs\/1902.04767","author":"Xie Yue","year":"2019","unstructured":"Yue Xie , Oscar Harper , Hirad Assimi , Aneta Neumann , and Frank Neumann . 2019. Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. CoRR abs\/1902.04767 ( 2019 ). arXiv:1902.04767 http:\/\/arxiv.org\/abs\/1902.04767 Conference version appears at GECCO 2019. Yue Xie, Oscar Harper, Hirad Assimi, Aneta Neumann, and Frank Neumann. 2019. Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. CoRR abs\/1902.04767 (2019). arXiv:1902.04767 http:\/\/arxiv.org\/abs\/1902.04767 Conference version appears at GECCO 2019."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.888929"}],"event":{"name":"FOGA '19: Foundations of Genetic Algorithms XV","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Potsdam Germany","acronym":"FOGA '19"},"container-title":["Proceedings of the 15th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299904.3340315","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299904.3340315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:39Z","timestamp":1750204419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299904.3340315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,27]]},"references-count":27,"alternative-id":["10.1145\/3299904.3340315","10.1145\/3299904"],"URL":"https:\/\/doi.org\/10.1145\/3299904.3340315","relation":{},"subject":[],"published":{"date-parts":[[2019,8,27]]},"assertion":[{"value":"2019-08-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}