{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T00:01:44Z","timestamp":1776816104909,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T00:00:00Z","timestamp":1562976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"South Australian Government","award":["Research Consortium ?Unlocking Complex Resources through Lean Processing?"],"award-info":[{"award-number":["Research Consortium ?Unlocking Complex Resources through Lean Processing?"]}]},{"DOI":"10.13039\/100012537","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP160102401"],"award-info":[{"award-number":["DP160102401"]}],"id":[{"id":"10.13039\/100012537","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,13]]},"DOI":"10.1145\/3321707.3321869","type":"proceedings-article","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T13:48:04Z","timestamp":1562161684000},"page":"338-346","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Evolutionary algorithms for the chance-constrained knapsack problem"],"prefix":"10.1145","author":[{"given":"Yue","family":"Xie","sequence":"first","affiliation":[{"name":"University of Adelaide, Adelaide, SA, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Harper","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, SA, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirad","family":"Assimi","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, SA, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, SA, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, SA, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Anand Bhalgat Ashish Goel and Sanjeev Khanna. 2011. Improved approximation results for stochastic knapsack problems. 1647--1665.   Anand Bhalgat Ashish Goel and Sanjeev Khanna. 2011. Improved approximation results for stochastic knapsack problems. 1647--1665.","DOI":"10.1137\/1.9781611973082.127"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.73"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0330"},{"key":"e_1_3_2_1_4_1","volume-title":"Probabilistic tools for the analysis of randomized optimization heuristics. arXiv:1801.06733","author":"Doerr Benjamin","year":"2018"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/245463.245599"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5812\/ijem.3505"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646517.694055"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796473"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2010.01.003"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.14.1.34"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.09.050"},{"key":"e_1_3_2_1_12_1","first-page":"217","article-title":"Knapsack problems","volume":"33","author":"Kellerer Hans","year":"2005","journal-title":"Business Economics"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258661"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2008.03.006"},{"key":"e_1_3_2_1_15_1","volume-title":"Uncertainty theory","author":"Liu Baoding"},{"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","doi-asserted-by":"publisher","DOI":"10.5555\/98124"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2023195"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TADVP.2004.841654"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.6.930"},{"key":"e_1_3_2_1_21_1","volume-title":"Parallel Problem Solving from Nature - PPSN VIII (Lecture Notes in Computer Science)","author":"Neumann Frank"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.005"},{"key":"e_1_3_2_1_23_1","volume-title":"GECCO","author":"Neumann Frank","year":"2004"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2180533"},{"key":"e_1_3_2_1_25_1","volume-title":"Artificial Intelligence and Statistics","volume":"54","author":"Pike-Burke Ciara","year":"2017"},{"key":"e_1_3_2_1_26_1","volume-title":"Genetic algorithm based technique for solving chance constrained problems. European journal of operational research 185, 3","author":"Poojari Chandra A","year":"2008"},{"key":"e_1_3_2_1_27_1","first-page":"441","article-title":"Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution","volume":"34","author":"Pr\u00e9kopa Andr\u00e1s","year":"1990","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","volume-title":"Stochastic Programming","author":"Pr\u00e9kopa Andr\u00e1s","DOI":"10.1007\/978-94-017-3087-7"},{"key":"e_1_3_2_1_29_1","volume-title":"Randomized algorithms","author":"Raghavan Prabhakar"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2016.09.002"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99253-2_13"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071270"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0451-4"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2006.09.003"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3150-7"}],"event":{"name":"GECCO '19: Genetic and Evolutionary Computation Conference","location":"Prague Czech Republic","acronym":"GECCO '19","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321869","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3321707.3321869","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:29Z","timestamp":1750206329000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321869"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,13]]},"references-count":35,"alternative-id":["10.1145\/3321707.3321869","10.1145\/3321707"],"URL":"https:\/\/doi.org\/10.1145\/3321707.3321869","relation":{},"subject":[],"published":{"date-parts":[[2019,7,13]]},"assertion":[{"value":"2019-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}