{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:43:50Z","timestamp":1762299830349,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"SA Government","award":["PRIF RCP Industry Consortium"],"award-info":[{"award-number":["PRIF RCP Industry Consortium"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,26]]},"DOI":"10.1145\/3449639.3459381","type":"proceedings-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T17:50:43Z","timestamp":1624297843000},"page":"1187-1194","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights"],"prefix":"10.1145","author":[{"given":"Yue","family":"Xie","sequence":"first","affiliation":[{"name":"The University of Adelaide, Adelaide, SA, Australia"}]},{"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, SA, Australia"}]},{"given":"Frank","family":"Neumann","sequence":"additional","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":[[2021,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. In ECAI 2020 - 24th European Conference on Artificial Intelligence","volume":"325","author":"Assimi Hirad","year":"2020","unstructured":"Hirad Assimi , Oscar Harper , Yue Xie , Aneta Neumann , and Frank Neumann . 2020 . Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. In ECAI 2020 - 24th European Conference on Artificial Intelligence , Vol. 325 . IOS Press, 307--314. Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, and Frank Neumann. 2020. Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. In ECAI 2020 - 24th European Conference on Artificial Intelligence, Vol. 325. IOS Press, 307--314."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Anne Auger and Benjamin Doerr. 2011. Theory of Randomized Search Heuristics. World Scientific.  Anne Auger and Benjamin Doerr. 2011. Theory of Randomized Search Heuristics. World Scientific.","DOI":"10.1142\/7438"},{"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.1016\/j.ejor.2018.11.071"},{"key":"e_1_3_2_1_5_1","volume-title":"Optimization of Chance-Constrained Submodular Functions. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI","author":"Doerr Benjamin","year":"2020","unstructured":"Benjamin Doerr , Carola Doerr , Aneta Neumann , Frank Neumann , and Andrew M. Sutton . 2020 . Optimization of Chance-Constrained Submodular Functions. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020 . AAAI Press, 1460--1467. Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, and Andrew M. Sutton. 2020. Optimization of Chance-Constrained Submodular Functions. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020. AAAI Press, 1460--1467."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.04.051"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0896-z"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1583"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900442"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.09.050"},{"volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"Jansen Thomas","key":"e_1_3_2_1_12_1","unstructured":"Thomas Jansen . 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective . Springer . Thomas Jansen. 2013. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer."},{"key":"e_1_3_2_1_13_1","volume-title":"General Drift Analysis with Tail Bounds. CoRR abs\/1307.2559","author":"Lehre Per Kristian","year":"2013","unstructured":"Per Kristian Lehre and Carsten Witt . 2013. General Drift Analysis with Tail Bounds. CoRR abs\/1307.2559 ( 2013 ). arXiv:1307.2559 http:\/\/arxiv.org\/abs\/1307.2559 Per Kristian Lehre and Carsten Witt. 2013. General Drift Analysis with Tail Bounds. CoRR abs\/1307.2559 (2013). arXiv:1307.2559 http:\/\/arxiv.org\/abs\/1307.2559"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2007.05.009"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0262-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2244898"},{"key":"e_1_3_2_1_17_1","unstructured":"Heinz M\u00fchlenbein. 1992. How Genetic Algorithms Really Work: Mutation and Hillclimbing. 15--26.  Heinz M\u00fchlenbein. 1992. How Genetic Algorithms Really Work: Mutation and Hillclimbing. 15--26."},{"key":"e_1_3_2_1_18_1","volume-title":"PPSN 2020, Proceedings, Part I (Lecture Notes in Computer Science","volume":"417","author":"Neumann Aneta","year":"2020","unstructured":"Aneta Neumann and Frank Neumann . 2020 . Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-objective Algorithms. In Parallel Problem Solving from Nature - PPSN XVI - 16th International Conference , PPSN 2020, Proceedings, Part I (Lecture Notes in Computer Science , Vol. 12269). Springer, 404-- 417 . Aneta Neumann and Frank Neumann. 2020. Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-objective Algorithms. In Parallel Problem Solving from Nature - PPSN XVI - 16th International Conference, PPSN 2020, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 12269). Springer, 404--417."},{"volume-title":"Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments","author":"Neumann Frank","key":"e_1_3_2_1_19_1","unstructured":"Frank Neumann , Mojgan Pourhassan , and Vahid Roostapour . 2020. Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments . Springer International Publishing , Cham , 323--357. Frank Neumann, Mojgan Pourhassan, and Vahid Roostapour. 2020. Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. Springer International Publishing, Cham, 323--357."},{"key":"e_1_3_2_1_20_1","volume-title":"Sutton","author":"Neumann Frank","year":"2019","unstructured":"Frank Neumann and Andrew M . Sutton . 2019 . Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. In FOGA. ACM , 147--153. Frank Neumann and Andrew M. Sutton. 2019. Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. In FOGA. ACM, 147--153."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16544-3"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2018.2833465"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.045"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2016.09.002"},{"key":"e_1_3_2_1_25_1","volume-title":"Pareto Optimization for Subset Selection with Dynamic Cost Constraints. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI","author":"Roostapour Vahid","year":"2019","unstructured":"Vahid Roostapour , Aneta Neumann , Frank Neumann , and Tobias Friedrich . 2019 . Pareto Optimization for Subset Selection with Dynamic Cost Constraints. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019. AAAI Press, 2354--2361. Vahid Roostapour, Aneta Neumann, Frank Neumann, and Tobias Friedrich. 2019. Pareto Optimization for Subset Selection with Dynamic Cost Constraints. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019. AAAI Press, 2354--2361."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2006.09.003"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Yue Xie Oscar Harper Hirad Assimi Aneta Neumann and Frank Neumann. 2019. Evolutionary algorithms for the chance-constrained knapsack problem. In GECCO. ACM 338--346.  Yue Xie Oscar Harper Hirad Assimi Aneta Neumann and Frank Neumann. 2019. Evolutionary algorithms for the chance-constrained knapsack problem. In GECCO. ACM 338--346.","DOI":"10.1145\/3321707.3321869"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Yue Xie Aneta Neumann and Frank Neumann. 2020. Specific single- and multiobjective evolutionary algorithms for the chance-constrained knapsack problem. In GECCO. ACM 271--279.  Yue Xie Aneta Neumann and Frank Neumann. 2020. Specific single- and multiobjective evolutionary algorithms for the chance-constrained knapsack problem. In GECCO. ACM 271--279.","DOI":"10.1145\/3377930.3390162"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.10.018"}],"event":{"name":"GECCO '21: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lille France","acronym":"GECCO '21"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459381","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449639.3459381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:09Z","timestamp":1750195689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,26]]},"references-count":29,"alternative-id":["10.1145\/3449639.3459381","10.1145\/3449639"],"URL":"https:\/\/doi.org\/10.1145\/3449639.3459381","relation":{},"subject":[],"published":{"date-parts":[[2021,6,26]]},"assertion":[{"value":"2021-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}