{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:57:37Z","timestamp":1783749457566,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FT200100536"],"award-info":[{"award-number":["FT200100536"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638529.3654176","type":"proceedings-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T16:33:04Z","timestamp":1720456384000},"page":"621-629","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2309-8034","authenticated-orcid":false,"given":"Xiankun","family":"Yan","sequence":"first","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0036-4782","authenticated-orcid":false,"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Shabbir Ahmed and Alexander Shapiro. 2008. Solving chance-constrained stochastic programs via sampling and integer programming. In State-of-the-art decision-making tools in the information-intensive age. Informs 261--269.","DOI":"10.1287\/educ.1080.0048"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654181"},{"key":"e_1_3_2_1_3_1","volume-title":"ECAI 2020 - 24th European Conference on Artificial Intelligence 2020 (Frontiers in Artificial Intelligence and Applications","volume":"314","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 2020 (Frontiers in Artificial Intelligence and Applications, Vol. 325). IOS Press, 307--314."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5504"},{"key":"e_1_3_2_1_5_1","volume-title":"Genetic and Evolutionary Computation Conference, GECCO","author":"Don Thilina Pathirage","year":"2024","unstructured":"Thilina Pathirage Don, Aneta Neumann, and Frank Neumann. 2024. The chance constrained travelling thief problem: Problem formulations and algorithms. In Genetic and Evolutionary Computation Conference, GECCO 2024. ACM. To appear."},{"key":"e_1_3_2_1_6_1","volume-title":"ECAI","author":"Dosko\u010d Vanja","year":"2020","unstructured":"Vanja Dosko\u010d, Tobias Friedrich, Andreas G\u00f6bel, Aneta Neumann, Frank Neumann, and Francesco Quinzan. 2020. Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings 1. In ECAI 2020. IOS Press, 435--442."},{"key":"e_1_3_2_1_7_1","volume-title":"The budgeted maximum coverage problem. Information processing letters 70, 1","author":"Khuller Samir","year":"1999","unstructured":"Samir Khuller, Anna Moss, and Joseph Seffi Naor. 1999. The budgeted maximum coverage problem. Information processing letters 70, 1 (1999), 39--45."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139177801.004"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/070702928"},{"key":"e_1_3_2_1_10_1","volume-title":"Best algorithms for approximating the maximum of a submodular set function. Mathematics of operations research 3, 3","author":"Nemhauser George L","year":"1978","unstructured":"George L Nemhauser and Laurence A Wolsey. 1978. Best algorithms for approximating the maximum of a submodular set function. Mathematics of operations research 3, 3 (1978), 177--188."},{"key":"e_1_3_2_1_11_1","volume-title":"An analysis of approximations for maximizing submodular set functions---I. Mathematical programming 14, 1","author":"Nemhauser George L","year":"1978","unstructured":"George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions---I. Mathematical programming 14, 1 (1978), 265--294."},{"key":"e_1_3_2_1_12_1","volume-title":"Scenario approximations of chance constraints. Probabilistic and randomized methods for design under uncertainty","author":"Nemirovski Arkadi","year":"2006","unstructured":"Arkadi Nemirovski and Alexander Shapiro. 2006. Scenario approximations of chance constraints. Probabilistic and randomized methods for design under uncertainty (2006), 3--47."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459385"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58112-1_28"},{"key":"e_1_3_2_1_15_1","volume-title":"PPSN 2022, Proceedings, Part I (Lecture Notes in Computer Science","volume":"307","author":"Neumann Aneta","year":"2022","unstructured":"Aneta Neumann, Yue Xie, and Frank Neumann. 2022. Evolutionary algorithms for limiting the effect of uncertainty for the knapsack problem with stochastic profits. In Parallel Problem Solving from Nature - PPSN XVII - 17th International Conference, PPSN 2022, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 13398). Springer, 294--307."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA230463"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654066"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654067"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1261985"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3638529.3654081"},{"key":"e_1_3_2_1_21_1","volume-title":"Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem. In International Conference on Parallel Problem Solving from Nature. Springer, 526--541","author":"Shi Feng","year":"2022","unstructured":"Feng Shi, Xiankun Yan, and Frank Neumann. 2022. Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem. In International Conference on Parallel Problem Solving from Nature. Springer, 526--541."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321869"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390162"},{"key":"e_1_3_2_1_24_1","volume-title":"GECCO '21: Genetic and Evolutionary Computation Conference. ACM, 1187--1194","author":"Xie Yue","unstructured":"Yue Xie, Aneta Neumann, Frank Neumann, and Andrew M. Sutton. 2021. Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights. In GECCO '21: Genetic and Evolutionary Computation Conference. ACM, 1187--1194."},{"key":"e_1_3_2_1_25_1","volume-title":"Feng Shi, Xiaoyu Qin, and Frank Neumann.","author":"Yan Xiankun","year":"2023","unstructured":"Xiankun Yan, Anh Viet Do, Feng Shi, Xiaoyu Qin, and Frank Neumann. 2023. Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties. In ECAI 2023. IOS Press, 2826--2833."}],"event":{"name":"GECCO '24: Genetic and Evolutionary Computation Conference","location":"Melbourne VIC Australia","acronym":"GECCO '24","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\/3638529.3654176","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638529.3654176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:56:54Z","timestamp":1750291014000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":25,"alternative-id":["10.1145\/3638529.3654176","10.1145\/3638529"],"URL":"https:\/\/doi.org\/10.1145\/3638529.3654176","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-07-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}