{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:57:36Z","timestamp":1783749456581,"version":"3.55.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030581114","type":"print"},{"value":"9783030581121","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58112-1_28","type":"book-chapter","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:04:30Z","timestamp":1599062670000},"page":"404-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-objective Algorithms"],"prefix":"10.1007","author":[{"given":"Aneta","family":"Neumann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"key":"28_CR1","unstructured":"Assimi, H., Harper, O., Xie, Y., Neumann, A., Neumann, F.: Evolutionary bi-objective optimization for the dynamic chance-constrained knapsack problem based on tail bound objectives. CoRR abs\/2002.06766 (2020). to appear at ECAI 2020"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Auger, A., Doerr, B.: Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing Co., Inc. (2011)","DOI":"10.1142\/7438"},{"key":"28_CR3","unstructured":"Bian, A.A., Buhmann, J.M., Krause, A., Tschiatschek, S.: Guarantees for Greedy maximization of non-submodular functions with applications. In: Proceedings of the 34th International Conference on Machine Learning, ICML 2017, vol. 70, pp. 498\u2013507. PMLR (2017)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"28_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/9781118165881","volume-title":"Nonparametric Statistics for Non-statisticians: A Step-by-Step Approach","author":"GW Corder","year":"2009","unstructured":"Corder, G.W., Foreman, D.I.: Nonparametric Statistics for Non-statisticians: A Step-by-Step Approach. Wiley, Hoboken (2009)"},{"key":"28_CR6","unstructured":"Doerr, B., Doerr, C., Neumann, A., Neumann, F., Sutton, A.M.: Optimization of chance-constrained submodular functions. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, pp. 1460\u20131467. AAAI Press (2020). https:\/\/www.aaai.org\/Papers\/AAAI\/2020GB\/AAAI-DoerrB.6164.pdf"},{"key":"28_CR7","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4","volume-title":"Theory of Evolutionary Computation - Recent developments in discrete optimization","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Neumann, F.: Theory of Evolutionary Computation - Recent developments in discrete optimization. Natural Computing Series. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4"},{"issue":"4","key":"28_CR8","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"28_CR9","unstructured":"Feldman, M., Harshaw, C., Karbasi, A.: Greed is good: Near-optimal submodular maximization via greedy optimization. In: COLT. Proceedings of Machine Learning Research, vol. 65, pp. 758\u2013784. PMLR (2017)"},{"issue":"4","key":"28_CR10","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1162\/EVCO_a_00159","volume":"23","author":"T Friedrich","year":"2015","unstructured":"Friedrich, T., Neumann, F.: Maximizing submodular functions under matroid constraints by evolutionary algorithms. Evol. Comput. 23(4), 543\u2013558 (2015)","journal-title":"Evol. Comput."},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-36494-3_37","volume-title":"STACS 2003","author":"O Giel","year":"2003","unstructured":"Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 415\u2013426. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_37"},{"key":"28_CR12","first-page":"427","volume":"42","author":"D Golovin","year":"2011","unstructured":"Golovin, D., Krause, A.: Adaptive submodularity: theory and applications in active learning and stochastic optimization. J. Artif. Intell. Res. 42, 427\u2013486 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"28_CR13","unstructured":"Harshaw, C., Feldman, M., Ward, J., Karbasi, A.: Submodular maximization beyond non-negativity: guarantees, fast algorithms, and applications. In: Proceedings of the 36th International Conference on Machine Learning, ICML 2019, vol. 97, pp. 2634\u20132643. PMLR (2019)"},{"key":"28_CR14","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"T Jansen","year":"2013","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms - The Computer Science Perspective. Natural Computing Series. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-17339-4"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. ACM (2003)","DOI":"10.1145\/956750.956769"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. Theory Comput. 11, 105\u2013147 (2015)","journal-title":"Theory Comput."},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Krause, A., Golovin, D.: Submodular function maximization. In: Tractability: Practical Approaches to Hard Problems, pp. 71\u2013104. Cambridge University Press (2014)","DOI":"10.1017\/CBO9781139177801.004"},{"key":"28_CR19","unstructured":"Krause, A., Guestrin, C.: Near-optimal observation selection using submodular functions. In: Proceedings of the Twenty-Second Conference on Artificial Intelligence, AAAI 2007, pp. 1650\u20131654. AAAI Press (2007)"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Lee, J., Mirrokni, V.S., Nagarajan, V., Sviridenko, M.: Non-monotone submodular maximization under matroid and knapsack constraints. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 323\u2013332. ACM (2009)","DOI":"10.1145\/1536414.1536459"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J.M., Glance, N.S.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2007, pp. 420\u2013429. ACM (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Mirzasoleiman, B., Jegelka, S., Krause, A.: Streaming non-monotone submodular maximization: personalized video summarization on the fly. In: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, AAAI 2018, pp. 1379\u20131386. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.11529"},{"key":"28_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"3","key":"28_CR24","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/moor.3.3.177","volume":"3","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res. 3(3), 177\u2013188 (1978)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"28_CR25","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions - I. Math. Program. 14(1), 265\u2013294 (1978). https:\/\/doi.org\/10.1007\/BF01588971","journal-title":"Math. Program."},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Neumann, F., Sutton, A.M.: Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. In: Proceedings of the 15th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2019, pp. 147\u2013153. ACM (2019)","DOI":"10.1145\/3299904.3340315"},{"key":"28_CR27","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired Computation in Combinatorial Optimization","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization. Natural Computing Series. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16544-3"},{"key":"28_CR28","unstructured":"Nguyen, T.H., Bui, T.: Benchmark instances. https:\/\/turing.cs.hbg.psu.edu\/txn131\/"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"Qian, C., Shi, J., Yu, Y., Tang, K.: On subset selection with general cost constraints. In: International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 2613\u20132619 (2017)","DOI":"10.24963\/ijcai.2017\/364"},{"key":"28_CR30","unstructured":"Qian, C., Shi, J., Yu, Y., Tang, K., Zhou, Z.: Subset selection under noise. In: Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems, NIPS 2017, pp. 3563\u20133573 (2017)"},{"key":"28_CR31","unstructured":"Qian, C., Yu, Y., Zhou, Z.: Subset selection by Pareto optimization. In: Proceedings of the 28th International Conference on Neural Information Processing Systems, NIPS 2015, vol. 1, pp. 1774\u20131782 (2015)"},{"key":"28_CR32","doi-asserted-by":"crossref","unstructured":"Roostapour, V., Neumann, A., Neumann, F., Friedrich, T.: Pareto optimization for subset selection with dynamic cost constraints. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, pp. 2354\u20132361. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33012354"},{"key":"28_CR33","first-page":"253","volume":"B23","author":"J Vondr\u00e1k","year":"2010","unstructured":"Vondr\u00e1k, J.: Submodularity and curvature: the optimal algorithm. RIMS K\u00f4ky\u00fbroku Bessatsu B23, 253\u2013266 (2010)","journal-title":"RIMS K\u00f4ky\u00fbroku Bessatsu"},{"key":"28_CR34","doi-asserted-by":"publisher","unstructured":"Xie, Y., Harper, O., Assimi, H., Neumann, A., Neumann, F.: Evolutionary algorithms for the chance-constrained knapsack problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, pp. 338\u2013346. ACM (2019). https:\/\/doi.org\/10.1145\/3321707.3321869","DOI":"10.1145\/3321707.3321869"},{"key":"28_CR35","doi-asserted-by":"crossref","unstructured":"Xie, Y., Neumann, A., Neumann, F.: Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem. CoRR abs\/2004.03205 (2020). to appear at GECCO 2020","DOI":"10.1145\/3377930.3390162"},{"key":"28_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, H., Vorobeychik, Y.: Submodular optimization with routing constraints. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence, AAAI 2016, pp. 819\u2013826. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10066"},{"key":"28_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-5956-9","volume-title":"Evolutionary Learning: Advances in Theories and Algorithms","author":"Z Zhou","year":"2019","unstructured":"Zhou, Z., Yu, Y., Qian, C.: Evolutionary Learning: Advances in Theories and Algorithms. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-981-13-5956-9"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58112-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T01:40:07Z","timestamp":1668562807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58112-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581114","9783030581121"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58112-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"31 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"268","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"99","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}