{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T16:43:57Z","timestamp":1751993037121,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"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":[{"name":"Australian Research Council award","award":["DP190103894","FT200100536"],"award-info":[{"award-number":["DP190103894","FT200100536"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,14]]},"DOI":"10.1145\/3638529.3654181","type":"proceedings-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T16:33:04Z","timestamp":1720456384000},"page":"1036-1044","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5307-2567","authenticated-orcid":false,"given":"Saba","family":"Sadeghi Ahouei","sequence":"first","affiliation":[{"name":"School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1169-1962","authenticated-orcid":false,"given":"Jacob","family":"De Nobel","sequence":"additional","affiliation":[{"name":"LIACS, Leiden University, Leiden, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0036-4782","authenticated-orcid":false,"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[{"name":"School of Computer and Mathematical Sciences, The University of Adelaide, adelaide, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6768-1478","authenticated-orcid":false,"given":"Thomas","family":"B\u00e4ck","sequence":"additional","affiliation":[{"name":"LIACS, Leiden University, leiden, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"School of Computer and Mathematical Sciences, The University of Adelaide, adelaide, Australia"}]}],"member":"320","published-online":{"date-parts":[[2024,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Benchmarking in Optimization: Best Practice and Open Issues. CoRR abs\/2007.03488","author":"Bartz-Beielstein Thomas","year":"2020","unstructured":"Thomas Bartz-Beielstein, Carola Doerr, Jakob Bossek, Sowmya Chandrasekaran, Tome Eftimov, Andreas Fischbach, Pascal Kerschke, Manuel L\u00f3pez-Ib\u00e1\u00f1ez, Katherine M. Malan, Jason H. Moore, Boris Naujoks, Patryk Orzechowski, Vanessa Volz, Markus Wagner, and Thomas Weise. 2020. Benchmarking in Optimization: Best Practice and Open Issues. CoRR abs\/2007.03488 (2020)."},{"doi-asserted-by":"crossref","unstructured":"Jakob Bossek Pascal Kerschke Aneta Neumann Markus Wagner Frank Neumann and Heike Trautmann. 2019. Evolving diverse TSP instances by means of novel and creative mutation operators. In FOGA. ACM 58--71.","key":"e_1_3_2_1_2_1","DOI":"10.1145\/3299904.3340307"},{"volume-title":"Submodular Maximization with Cardinality Constraints","author":"Buchbinder Niv","unstructured":"Niv Buchbinder, Moran Feldman, Joseph Naor, and Roy Schwartz. 2014. Submodular Maximization with Cardinality Constraints. In SODA. SIAM, 1433--1452.","key":"e_1_3_2_1_3_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1137\/080733991"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1007\/BF02579361"},{"key":"e_1_3_2_1_6_1","volume-title":"IOHexperimenter: Benchmarking Platform for Iterative Optimization Heuristics. CoRR abs\/2111.04077","author":"de Nobel Jacob","year":"2021","unstructured":"Jacob de Nobel, Furong Ye, Diederick Vermetten, Hao Wang, Carola Doerr, and Thomas B\u00e4ck. 2021. IOHexperimenter: Benchmarking Platform for Iterative Optimization Heuristics. CoRR abs\/2111.04077 (2021)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.24963\/ijcai.2023\/617"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/978-3-030-58115-2_41"},{"key":"e_1_3_2_1_9_1","volume-title":"Sutton","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 AAAI. AAAI Press, 1460--1467."},{"key":"e_1_3_2_1_10_1","volume-title":"IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristics. CoRR abs\/1810.05281","author":"Doerr Carola","year":"2018","unstructured":"Carola Doerr, Hao Wang, Furong Ye, Sander van Rijn, and Thomas B\u00e4ck. 2018. IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristics. CoRR abs\/1810.05281 (2018)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1016\/j.asoc.2019.106027"},{"key":"e_1_3_2_1_12_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_13_1","volume-title":"Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. In ECAI 2020 - 24th European Conference on Artificial Intelligence","volume":"325","author":"Doskoc Vanja","year":"2020","unstructured":"Vanja Doskoc, 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. In ECAI 2020 - 24th European Conference on Artificial Intelligence 2020, Vol. 325. IOS Press, 435--442."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1137\/090779346"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings (Lecture Notes in Computer Science","volume":"931","author":"Friedrich Tobias","year":"2014","unstructured":"Tobias Friedrich and Frank Neumann. 2014. Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms. In Parallel Problem Solving from Nature - PPSN XIII - 13th International Conference 2014. Proceedings (Lecture Notes in Computer Science, Vol. 8672). Springer, 922--931."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1162\/EVCO_a_00159"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1162\/evco_a_00274"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1162\/evco_a_00242"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/TEVC.2013.2244898"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/s10472-013-9341-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1287\/moor.3.3.177"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1007\/BF01588971"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/3449639.3459385"},{"volume-title":"PPSN (1) (Lecture Notes in Computer Science","author":"Neumann Aneta","unstructured":"Aneta Neumann and Frank Neumann. 2020. Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-objective Algorithms. In PPSN (1) (Lecture Notes in Computer Science, Vol. 12269). Springer, 404--417.","key":"e_1_3_2_1_24_1"},{"volume-title":"PPSN (1) (Lecture Notes in Computer Science","author":"Neumann Aneta","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 PPSN (1) (Lecture Notes in Computer Science, Vol. 13398). Springer, 294--307.","key":"e_1_3_2_1_25_1"},{"key":"e_1_3_2_1_26_1","volume-title":"Jacob de Nobel, Diederick Vermetten, Saba Sadeghi Ahouei, Furong Ye, Hao Wang, and Thomas B\u00e4ck.","author":"Neumann Frank","year":"2023","unstructured":"Frank Neumann, Aneta Neumann, Chao Qian, Anh Viet Do, Jacob de Nobel, Diederick Vermetten, Saba Sadeghi Ahouei, Furong Ye, Hao Wang, and Thomas B\u00e4ck. 2023. Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler. In CEC. IEEE, 1--9."},{"volume-title":"Feature-based algorithm selection for constrained continuous optimisation","author":"Neumann Frank","unstructured":"Frank Neumann and Shayan Poursoltan. 2016. Feature-based algorithm selection for constrained continuous optimisation. In CEC. IEEE, 1461--1468.","key":"e_1_3_2_1_27_1"},{"doi-asserted-by":"crossref","unstructured":"Frank Neumann and Carsten Witt. 2022. Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables. In IJCAI. ijcai.org 4800--4806.","key":"e_1_3_2_1_28_1","DOI":"10.24963\/ijcai.2022\/665"},{"doi-asserted-by":"crossref","unstructured":"Frank Neumann and Carsten Witt. 2023. 3-Objective Pareto Optimization for Problems with Chance Constraints. In GECCO. ACM 731--739.","key":"e_1_3_2_1_29_1","DOI":"10.1145\/3583131.3590392"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/3638529.3654066"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/3638529.3654067"},{"key":"e_1_3_2_1_32_1","volume-title":"Multi-objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem. In Genetic and Evolutionary Computation Conference, GECCO","author":"Perera Kokila","year":"2024","unstructured":"Kokila Perera and Aneta Neumann. 2024. Multi-objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem. In Genetic and Evolutionary Computation Conference, GECCO 2024. ACM. To appear."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1016\/j.ejor.2006.06.045"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"e_1_3_2_1_35_1","volume-title":"Ahmed","author":"Rossi Ryan A.","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. AAAI Press, 4292--4293."},{"volume-title":"PPSN (2) (Lecture Notes in Computer Science","author":"Shi Feng","unstructured":"Feng Shi, Xiankun Yan, and Frank Neumann. 2022. Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem. In PPSN (2) (Lecture Notes in Computer Science, Vol. 13399). Springer, 526--541.","key":"e_1_3_2_1_36_1"},{"key":"e_1_3_2_1_37_1","volume-title":"Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41, 1","author":"Smith-Miles Kate","year":"2008","unstructured":"Kate Smith-Miles. 2008. Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41, 1 (2008), 6:1--6:25."},{"volume-title":"Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting","author":"Stimson Michael","unstructured":"Michael Stimson, William Reid, Aneta Neumann, Simon Ratcliffe, and Frank Neumann. 2023. Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting. In CEC. IEEE, 1--10.","key":"e_1_3_2_1_38_1"},{"key":"e_1_3_2_1_39_1","volume-title":"IOHanalyzer: Detailed performance analyses for iterative optimization heuristics: hot-off-the-press track @ GECCO","author":"Wang Hao","year":"2022","unstructured":"Hao Wang, Diederick Vermetten, Furong Ye, Carola Doerr, and Thomas B\u00e4ck. 2022. IOHanalyzer: Detailed performance analyses for iterative optimization heuristics: hot-off-the-press track @ GECCO 2022. In GECCO Companion. ACM, 49--50."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1109\/4235.585893"},{"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.","key":"e_1_3_2_1_41_1","DOI":"10.1145\/3321707.3321869"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1145\/3377930.3390162"},{"key":"e_1_3_2_1_43_1","volume-title":"Sutton","author":"Xie Yue","year":"2021","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. ACM, 1187--1194."},{"key":"e_1_3_2_1_44_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 - 26th European Conference on Artificial Intelligence 2023 (Frontiers in Artificial Intelligence and Applications, Vol. 372). IOS Press, 2826--2833."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_45_1","DOI":"10.1145\/3638529.3654176"}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"acronym":"GECCO '24","name":"GECCO '24: Genetic and Evolutionary Computation Conference","location":"Melbourne VIC Australia"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654181","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638529.3654181","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.3654181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":45,"alternative-id":["10.1145\/3638529.3654181","10.1145\/3638529"],"URL":"https:\/\/doi.org\/10.1145\/3638529.3654181","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"}}]}}