{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:37:45Z","timestamp":1767339465810,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700545"},{"type":"electronic","value":"9783031700552"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70055-2_2","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:02:54Z","timestamp":1725649374000},"page":"20-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sliding Window Bi-objective Evolutionary Algorithms for\u00a0Optimizing Chance-Constrained Monotone Submodular Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2309-8034","authenticated-orcid":false,"given":"Xiankun","family":"Yan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0036-4782","authenticated-orcid":false,"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","volume":"6","author":"A Charnes","year":"1959","unstructured":"Charnes, A., Cooper, W.W.: Chance-constrained programming. Manage. Sci. 6(1), 73\u201379 (1959)","journal-title":"Manage. Sci."},{"key":"2_CR2","unstructured":"Corder, G.W., Foreman, D.I.: Nonparametric statistics for non-statisticians (2011)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Corus, D., Lehre, P.K., Neumann, F.: The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation. In: Proceedings of the 15th annual conference on Genetic and evolutionary computation, pp. 519\u2013526 (2013)","DOI":"10.1145\/2463372.2463442"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Neumann, A., Neumann, F., Sutton, A.: Optimization of chance-constrained submodular functions. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a034, pp. 1460\u20131467 (2020)","DOI":"10.1609\/aaai.v34i02.5504"},{"key":"2_CR5","unstructured":"Don, T.P., Neumann, A., Neumann, F.: The chance constrained travelling thief problem: Problem formulations and algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2024. ACM (2024), to appear"},{"issue":"4","key":"2_CR6","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 (JACM) 45(4), 634\u2013652 (1998)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco.2009.17.1.3","volume":"17","author":"T Friedrich","year":"2009","unstructured":"Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C.: Analyses of simple hybrid algorithms for the vertex cover problem. Evol. Comput. 17(1), 3\u201319 (2009)","journal-title":"Evol. Comput."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Hebbinghaus, N., Neumann, F., He, J., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models. In: Proceedings of the 9th annual conference on Genetic and evolutionary computation, pp. 797\u2013804 (2007)","DOI":"10.1145\/1276958.1277118"},{"issue":"2","key":"2_CR9","first-page":"409","volume":"17","author":"K Iwamura","year":"1996","unstructured":"Iwamura, K., Liu, B.: A genetic algorithm for chance constrained programming. J. Inf. Optim. Sci. 17(2), 409\u2013422 (1996)","journal-title":"J. Inf. Optim. Sci."},{"issue":"1","key":"2_CR10","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.S.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-15844-5_21","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"S Kratsch","year":"2010","unstructured":"Kratsch, S., Lehre, P.K., Neumann, F., Oliveto, P.S.: Fixed parameter evolutionary algorithms and maximum leaf spanning trees: a matter of mutation. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 204\u2013213. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_21"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Qin, X.: More precise runtime analyses of non-elitist eas in uncertain environments. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1160\u20131168 (2021)","DOI":"10.1145\/3449639.3459312"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00453-016-0262-4","volume":"78","author":"A Lissovoi","year":"2017","unstructured":"Lissovoi, A., Witt, C.: A runtime analysis of parallel evolutionary algorithms in dynamic optimization. Algorithmica 78, 641\u2013659 (2017)","journal-title":"Algorithmica"},{"issue":"6","key":"2_CR15","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1287\/opre.13.6.930","volume":"13","author":"BL Miller","year":"1965","unstructured":"Miller, B.L., Wagner, H.M.: Chance constrained programming with joint constraints. Oper. Res. 13(6), 930\u2013945 (1965)","journal-title":"Oper. Res."},{"issue":"1","key":"2_CR16","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)","journal-title":"Math. Program."},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-030-58112-1_28","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"A Neumann","year":"2020","unstructured":"Neumann, A., Neumann, F.: Optimising monotone chance-constrained submodular functions using evolutionary multi-objective algorithms. In: B\u00e4ck, T., Preuss, M., Deutz, A., Wang, H., Doerr, C., Emmerich, M., Trautmann, H. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 404\u2013417. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_28"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Neumann, F., Pourhassan, M., Roostapour, V.: Analysis of evolutionary algorithms in dynamic and stochastic environments. Theory of evolutionary computation: recent developments in discrete optimization, pp. 323\u2013357 (2020)","DOI":"10.1007\/978-3-030-29414-4_7"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-319-99259-4_12","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"F Neumann","year":"2018","unstructured":"Neumann, F., Sutton, A.M.: Runtime analysis of evolutionary algorithms for the knapsack problem with favorably correlated weights. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 141\u2013152. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_12"},{"key":"2_CR20","unstructured":"Neumann, F., Witt, C.: On the runtime of randomized local search and simple evolutionary algorithms for dynamic makespan scheduling. In: 24th International Joint Conference on Artificial Intelligence, pp. 3742\u20133748. AAAI Press (2015)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Neumann, F., Witt, C.: Fast pareto optimization using sliding window selection. In: ECAI 2023, pp. 1771\u20131778. IOS Press (2023)","DOI":"10.3233\/FAIA230463"},{"key":"2_CR22","unstructured":"Pathiranage, I.H., Neumann, F., Antipov, D., Neumann, A.: Effective 2- and 3-objective moea\/d approaches for the chance constrained knapsack problem. In: Genetic and Evolutionary Computation Conference, GECCO 2024. ACM (2024), to appear"},{"key":"2_CR23","unstructured":"Pathiranage, I.H., Neumann, F., Antipov, D., Neumann, A.: Using 3-objective evolutionary algorithms for the dynamic chance constrained knapsack problem. In: Genetic and Evolutionary Computation Conference, GECCO 2024. ACM (2024), to appear"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Perera, K., Neumann, A.: Multi-objective evolutionary algorithms with sliding window selection for the dynamic chance-constrained knapsack problem. In: Genetic and Evolutionary Computation Conference, GECCO 2024. ACM (2024), to appear","DOI":"10.1145\/3638529.3654081"},{"issue":"3","key":"2_CR25","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1016\/j.ejor.2006.06.045","volume":"185","author":"CA Poojari","year":"2008","unstructured":"Poojari, C.A., Varghese, B.: Genetic algorithm based technique for solving chance constrained problems. Eur. J. Oper. Res. 185(3), 1128\u20131154 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-99253-2_13","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"V Roostapour","year":"2018","unstructured":"Roostapour, V., Neumann, A., Neumann, F.: On the performance of baseline evolutionary algorithms on the dynamic knapsack problem. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 158\u2013169. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_13"},{"key":"2_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103597","volume":"302","author":"V Roostapour","year":"2022","unstructured":"Roostapour, V., Neumann, A., Neumann, F., Friedrich, T.: Pareto optimization for subset selection with dynamic cost constraints. Artif. Intell. 302, 103597 (2022)","journal-title":"Artif. Intell."},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Rossi, R., Ahmed, N.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a029 (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Shi, F., Neumann, F., Wang, J.: Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1515\u20131522 (2018)","DOI":"10.1145\/3205455.3205580"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Shi, F., Yan, X., Neumann, F.: Runtime analysis of simple evolutionary algorithms for the chance-constrained makespan scheduling problem. In: International Conference on Parallel Problem Solving from Nature, pp. 526\u2013541. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-14721-0_37","DOI":"10.1007\/978-3-031-14721-0_37"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Wu, J., Polyakovskiy, S., Neumann, F.: On the impact of the renting rate for the unconstrained nonlinear knapsack problem. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 413\u2013419 (2016)","DOI":"10.1145\/2908812.2908862"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Yan, X., Do, A.V., Shi, F., Qin, X., Neumann, F.: Optimizing chance-constrained submodular problems with variable uncertainties. In: ECAI 2023, pp. 2826\u20132833. IOS Press (2023)","DOI":"10.3233\/FAIA230594"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Yan, X., Neumann, A., Neumann, F.: Sampling-based pareto optimization for chance-constrained monotone submodular problems. In: Genetic and Evolutionary Computation Conference, GECCO 2024. ACM (2024), to appear","DOI":"10.1145\/3638529.3654176"},{"key":"2_CR34","unstructured":"Yaroslavtsev, G., Zhou, S., Avdiukhin, D.: \u201cbring your own greedy\u201d+ max: Near-optimal 1\/2-approximations for submodular knapsack. In: International Conference on Artificial Intelligence and Statistics, pp. 3263\u20133274. PMLR (2020)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70055-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:03:18Z","timestamp":1725649398000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70055-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700545","9783031700552"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70055-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","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":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}