{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T22:21:37Z","timestamp":1787437297781,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032362223","type":"print"},{"value":"9783032362230","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T00:00:00Z","timestamp":1787443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T00:00:00Z","timestamp":1787443200000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-36223-0_16","type":"book-chapter","created":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T21:44:42Z","timestamp":1787435082000},"page":"250-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multitask Pareto Optimization for\u00a0Monotone Submodular Problems with\u00a0Dynamic Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-5241-3562","authenticated-orcid":false,"given":"Liam","family":"Wigney","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,23]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Bian, C., Qian, C., Neumann, F., Yu, Y.: Fast pareto optimization for subset selection with dynamic cost constraints. In: IJCAI, pp. 2191\u20132197. IJCAI (2021). https:\/\/doi.org\/10.24963\/ijcai.2021\/302","DOI":"10.24963\/ijcai.2021\/302"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Chen, X., Peng, B.: On the complexity of dynamic submodular maximization. In: STOC, pp. 1685\u20131698. ACM (2022). https:\/\/doi.org\/10.1145\/3519935.3519951","DOI":"10.1145\/3519935.3519951"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Da, B., Gupta, A., Ong, Y., Feng, L.: Evolutionary multitasking across single and multi-objective formulations for improved problem solving. In: CEC, pp. 1695\u20131701. IEEE (2016). https:\/\/doi.org\/10.1109\/CEC.2016.7743992","DOI":"10.1109\/CEC.2016.7743992"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Do, A.V., Neumann, F.: Maximizing submodular or monotone functions under partition matroid constraints by multi-objective evolutionary algorithms. In: PPSN (2). Lecture Notes in Computer Science, vol. 12270, pp. 588\u2013603. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-58115-2_41","DOI":"10.1007\/978-3-030-58115-2_41"},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Doerr, B., Neumann, F. (eds.): Theory of Evolutionary Computation - Recent Developments in Discrete Optimization. Natural Computing Series, Springer (2020).https:\/\/doi.org\/10.1007\/978-3-030-29414-4","DOI":"10.1007\/978-3-030-29414-4"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Don, T.P., Neumann, A., Neumann, F.: Evolutionary multitasking for the scenario-based travelling thief problem. In: GECCO, pp. 809\u2013817. ACM (2025). https:\/\/doi.org\/10.1145\/3712256.3726468","DOI":"10.1145\/3712256.3726468"},{"issue":"6","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.22768","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995). https:\/\/doi.org\/10.1145\/227683.22768","journal-title":"J. ACM"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.ins.2022.05.037","volume":"605","author":"Z Hu","year":"2022","unstructured":"Hu, Z., Li, Y., Sun, H., Ma, X.: Multitasking multiobjective optimization based on transfer component analysis. Inf. Sci. 605, 182\u2013201 (2022). https:\/\/doi.org\/10.1016\/j.ins.2022.05.037","journal-title":"Inf. Sci."},{"issue":"1","key":"16_CR9","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). https:\/\/doi.org\/10.1016\/S0020-0190(99)00031-9","journal-title":"Inf. Process. Lett."},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Krause, A., Golovin, D.: Submodular function maximization. In: Tractability, pp. 71\u2013104. Cambridge University Press (2014). https:\/\/doi.org\/10.1017\/CBO9781139177801.004","DOI":"10.1017\/CBO9781139177801.004"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Lengler, J., Neumann, A., Neumann, F.: Runtime analysis of evolutionary multitasking for classical benchmark problems. In: GECCO, pp. 1613\u20131621. ACM (2025). https:\/\/doi.org\/10.1145\/3712256.3726369","DOI":"10.1145\/3712256.3726369"},{"issue":"6","key":"16_CR12","doi-asserted-by":"publisher","first-page":"3238","DOI":"10.1109\/TCYB.2020.2969025","volume":"51","author":"J Lin","year":"2021","unstructured":"Lin, J., Liu, H., Tan, K.C., Gu, F.: An effective knowledge transfer approach for multiobjective multitasking optimization. IEEE Trans. Cybern. 51(6), 3238\u20133248 (2021). https:\/\/doi.org\/10.1109\/TCYB.2020.2969025","journal-title":"IEEE Trans. Cybern."},{"issue":"5","key":"16_CR13","doi-asserted-by":"publisher","first-page":"3146","DOI":"10.1109\/TCYB.2023.3266241","volume":"54","author":"Q Lin","year":"2024","unstructured":"Lin, Q., Wu, Z., Ma, L., Gong, M., Li, J., Coello, C.A.C.: Multiobjective multitasking optimization with decomposition-based transfer selection. IEEE Trans. Cybern. 54(5), 3146\u20133159 (2024). https:\/\/doi.org\/10.1109\/TCYB.2023.3266241","journal-title":"IEEE Trans. Cybern."},{"issue":"3","key":"16_CR14","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). https:\/\/doi.org\/10.1287\/moor.3.3.177","journal-title":"Math. Oper. Res."},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1162\/evco_a_00360","volume":"33","author":"A Neumann","year":"2025","unstructured":"Neumann, A., Neumann, F.: Optimizing monotone chance-constrained submodular functions using evolutionary multiobjective algorithms. Evol. Comput. 33(3), 363\u2013393 (2025). https:\/\/doi.org\/10.1162\/evco_a_00360","journal-title":"Evol. Comput."},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Neumann, F., Rudolph, G.: Archive-based single-objective evolutionary algorithms for submodular optimization. In: PPSN (3). Lecture Notes in Computer Science, vol. 15150, pp. 166\u2013180. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-70071-2_11","DOI":"10.1007\/978-3-031-70071-2_11"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Neumann, F., Witt, C.: Fast pareto optimization using sliding window selection for problems with deterministic and stochastic constraints. Evol. Comput., 1\u201342 (2026). https:\/\/doi.org\/10.1162\/EVCO.a.368","DOI":"10.1162\/EVCO.a.368"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Ong, Y.: Towards evolutionary multitasking: a new paradigm. In: SoICT, p 2. ACM (2015)","DOI":"10.1145\/2833258.2833259"},{"issue":"3","key":"16_CR19","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s12559-022-10012-8","volume":"14","author":"E Osaba","year":"2022","unstructured":"Osaba, E., Ser, J.D., Martinez, A.D., Hussain, A.: Evolutionary multitask optimization: a methodological overview, challenges, and future research directions. Cogn. Comput. 14(3), 927\u2013954 (2022). https:\/\/doi.org\/10.1007\/s12559-022-10012-8","journal-title":"Cogn. Comput."},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.artint.2019.06.005","volume":"275","author":"C Qian","year":"2019","unstructured":"Qian, C., Yu, Y., Tang, K., Yao, X., Zhou, Z.: Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms. Artif. Intell. 275, 279\u2013294 (2019). https:\/\/doi.org\/10.1016\/j.artint.2019.06.005","journal-title":"Artif. Intell."},{"issue":"3","key":"16_CR21","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1109\/TEVC.2022.3175065","volume":"27","author":"K Qiao","year":"2023","unstructured":"Qiao, K., et al.: Dynamic auxiliary task-based evolutionary multitasking for constrained multiobjective optimization. IEEE Trans. Evol. Comput. 27(3), 642\u2013656 (2023). https:\/\/doi.org\/10.1109\/TEVC.2022.3175065","journal-title":"IEEE Trans. Evol. Comput."},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"103597","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). https:\/\/doi.org\/10.1016\/j.artint.2021.103597","journal-title":"Artif. Intell."},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI, pp. 4292\u20134293. AAAI Press (2015). https:\/\/doi.org\/10.5555\/2888116.2888372","DOI":"10.5555\/2888116.2888372"},{"key":"16_CR24","doi-asserted-by":"publisher","unstructured":"Scott, E.O., De Jong, K.A.: First complexity results for evolutionary knowledge transfer. In: FOGA, pp. 140\u2013151. ACM (2023). https:\/\/doi.org\/10.1145\/3594805.3607137","DOI":"10.1145\/3594805.3607137"},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Scott, E.O., De Jong, K.A.: Varying difficulty of knowledge reuse in benchmarks for evolutionary knowledge transfer. In: CEC, pp.\u00a01\u20138. IEEE (2024). https:\/\/doi.org\/10.1109\/CEC60901.2024.10612149","DOI":"10.1109\/CEC60901.2024.10612149"},{"key":"16_CR26","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.isatra.2023.03.015","volume":"138","author":"H Sun","year":"2023","unstructured":"Sun, H., Chen, P., Hu, Z., Wei, L.: Multi-objective evolutionary multitasking algorithm based on cross-task transfer solution matching strategy. ISA Trans. 138, 504\u2013520 (2023). https:\/\/doi.org\/10.1016\/j.isatra.2023.03.015","journal-title":"ISA Trans."},{"key":"16_CR27","doi-asserted-by":"publisher","first-page":"7842","DOI":"10.1038\/s41598-023-33414-6","volume":"13","author":"CS Tan","year":"2023","unstructured":"Tan, C.S., Gupta, A., Ong, Y.S., Pratama, M., Tan, P.S., Lam, S.K.: Pareto optimization with small data by learning across common objective spaces. Sci. Rep. 13, 7842 (2023). https:\/\/doi.org\/10.1038\/s41598-023-33414-6","journal-title":"Sci. Rep."},{"issue":"5","key":"16_CR28","doi-asserted-by":"publisher","first-page":"1990","DOI":"10.1109\/TEVC.2024.3449142","volume":"29","author":"Z Wang","year":"2025","unstructured":"Wang, Z., Xu, D., Jiang, M., Tan, K.C.: Spatial-temporal knowledge transfer for dynamic constrained multiobjective optimization. IEEE Trans. Evol. Comput. 29(5), 1990\u20132003 (2025). https:\/\/doi.org\/10.1109\/TEVC.2024.3449142","journal-title":"IEEE Trans. Evol. Comput."},{"key":"16_CR29","doi-asserted-by":"publisher","unstructured":"Wigney, L., Neumann, A., Ong, Y., Neumann, F.: On the use of matching algorithms to transfer solutions for the travelling salesperson problem. In: GECCO, pp. 845\u2013853. ACM (2025). https:\/\/doi.org\/10.1145\/3712256.3726469","DOI":"10.1145\/3712256.3726469"},{"key":"16_CR30","unstructured":"Wigney, L., Neumann, F.: Analysis of multitasking pareto optimization for monotone submodular problems (2026). https:\/\/arxiv.org\/abs\/2604.15068"},{"key":"16_CR31","doi-asserted-by":"publisher","unstructured":"Witt, C.: Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. In: GECCO (Companion), pp. 647\u2013686. ACM (2014). https:\/\/doi.org\/10.1145\/2464576.2466738","DOI":"10.1145\/2464576.2466738"},{"key":"16_CR32","doi-asserted-by":"publisher","unstructured":"Yan, X., Neumann, A., Neumann, F.: Sliding window bi-objective evolutionary algorithms for optimizing chance-constrained monotone submodular functions. In: PPSN (1). Lecture Notes in Computer Science, vol. 15148, pp. 20\u201335. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-70055-2_2","DOI":"10.1007\/978-3-031-70055-2_2"},{"key":"16_CR33","doi-asserted-by":"publisher","unstructured":"Yuan, Y., Ong, Y.S., Gupta, A., Tan, P.S., Xu, H.: Evolutionary multitasking in permutation-based combinatorial optimization problems: realization with TSP, QAP, LOP, and JSP. In: 2016 IEEE Region 10 Conference (TENCON), pp. 3157\u20133164 (2016). https:\/\/doi.org\/10.1109\/TENCON.2016.7848632","DOI":"10.1109\/TENCON.2016.7848632"},{"issue":"4","key":"16_CR34","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1109\/TCYB.2020.3024849","volume":"51","author":"F Zhang","year":"2021","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Evolving scheduling heuristics via genetic programming with feature selection in dynamic flexible job-shop scheduling. IEEE Trans. Cybern. 51(4), 1797\u20131811 (2021). https:\/\/doi.org\/10.1109\/TCYB.2020.3024849","journal-title":"IEEE Trans. Cybern."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-36223-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T21:44:43Z","timestamp":1787435083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-36223-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,23]]},"ISBN":["9783032362223","9783032362230"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-36223-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,23]]},"assertion":[{"value":"23 August 2026","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":"Trento","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}