{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:35Z","timestamp":1759847255322,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700842"},{"type":"electronic","value":"9783031700859"}],"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-70085-9_15","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:54Z","timestamp":1725663774000},"page":"236-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Biased Pareto Optimization for\u00a0Subset Selection with\u00a0Dynamic Cost Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7076-823X","authenticated-orcid":false,"given":"Dan-Xuan","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6011-2512","authenticated-orcid":false,"given":"Chao","family":"Qian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming. Genetic Algorithms. Oxford University Press, Oxford, UK (1996)"},{"doi-asserted-by":"crossref","unstructured":"Bian, C., Feng, C., Qian, C., Yu, Y.: An efficient evolutionary algorithm for subset selection with general cost constraints. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), pp. 3267\u20133274. New York, NY (2020)","key":"15_CR2","DOI":"10.1609\/aaai.v34i04.5726"},{"doi-asserted-by":"crossref","unstructured":"Bian, C., Qian, C., Neumann, F., Yu, Y.: Fast Pareto optimization for subset selection with dynamic cost constraints. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021), pp. 2191\u20132197. Montreal, Canada (2021)","key":"15_CR3","DOI":"10.24963\/ijcai.2021\/302"},{"doi-asserted-by":"crossref","unstructured":"Bian, C., Zhou, Y., Qian, C.: Robust subset selection by greedy and evolutionary Pareto optimization. In: Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI 2022), pp. 4726\u20134732. Vienna, Austria (2022)","key":"15_CR4","DOI":"10.24963\/ijcai.2022\/655"},{"doi-asserted-by":"crossref","unstructured":"Bossek, J., Neumann, F., Peng, P., Sudholt, D.: Runtime analysis of randomized search heuristics for dynamic graph coloring. In: Proceedings of the 21st ACM Conference on Genetic and Evolutionary Computation Conference (GECCO 2019), pp. 1443\u20131451. Prague, Czech Republic (2019)","key":"15_CR5","DOI":"10.1145\/3321707.3321792"},{"key":"15_CR6","volume-title":"Evolutionary Algorithms for Solving Multi-Objective Problems","author":"CAC Coello","year":"2007","unstructured":"Coello, C.A.C., Lamont, G.B., van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-Objective Problems. Springer, New York, NY (2007)"},{"doi-asserted-by":"crossref","unstructured":"Do, A.V., Neumann, F.: Pareto optimization for subset selection with dynamic partition matroid constraints. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021), pp. 12284\u201312292. Virtual (2021)","key":"15_CR7","DOI":"10.1609\/aaai.v35i14.17458"},{"issue":"4","key":"15_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"},{"issue":"4","key":"15_CR9","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."},{"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), pp. 2634\u20132643. Long Beach, California (2019)","key":"15_CR10"},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s11633-020-1253-0","volume":"18","author":"WJ Hong","year":"2021","unstructured":"Hong, W.J., Yang, P., Tang, K.: Evolutionary computation for large-scale multi-objective optimization: a decade of progresses. Int. J. Autom. Comput. 18(2), 155\u2013169 (2021)","journal-title":"Int. J. Autom. Comput."},{"doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003), pp. 137\u2013146. Washington, DC (2003)","key":"15_CR12","DOI":"10.1145\/956750.956769"},{"key":"15_CR13","first-page":"235","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause, A., Singh, A., Guestrin, C.: Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies. J. Mach. Learn. Res. 9, 235\u2013284 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1109\/TEVC.2004.823470","volume":"8","author":"M Laumanns","year":"2004","unstructured":"Laumanns, M., Thiele, L., Zitzler, E.: Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions. IEEE Trans. Evol. Comput. 8(2), 170\u2013182 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"15_CR15","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."},{"issue":"4","key":"15_CR16","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/TEVC.2019.2929555","volume":"24","author":"C Qian","year":"2020","unstructured":"Qian, C.: Distributed Pareto optimization for large-scale noisy subset selection. IEEE Trans. Evol. Comput. 24(4), 694\u2013707 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1162\/evco_a_00288","volume":"29","author":"C Qian","year":"2021","unstructured":"Qian, C.: Multi-objective evolutionary algorithms are still good: maximizing monotone approximately submodular minus modular functions. Evol. Comput. 29(4), 463\u2013490 (2021)","journal-title":"Evol. Comput."},{"doi-asserted-by":"crossref","unstructured":"Qian, C., Bian, C., Feng, C.: Subset selection by Pareto optimization with recombination. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), pp. 2408\u20132415. New York, NY (2020)","key":"15_CR18","DOI":"10.1609\/aaai.v34i03.5621"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.tcs.2022.12.011","volume":"943","author":"C Qian","year":"2023","unstructured":"Qian, C., Liu, D., Feng, C., Tang, K.: Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences. Theoret. Comput. Sci. 943, 241\u2013266 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103737","volume":"309","author":"C Qian","year":"2022","unstructured":"Qian, C., Liu, D., Zhou, Z.: Result diversification by multi-objective evolutionary algorithms with theoretical guarantees. Artif. Intell. 309, 103737 (2022)","journal-title":"Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Qian, C., Shi, J., Yu, Y., Tang, K.: On subset selection with general cost constraints. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pp. 2613\u20132619. Melbourne, Australia (2017)","key":"15_CR21","DOI":"10.24963\/ijcai.2017\/364"},{"doi-asserted-by":"crossref","unstructured":"Qian, C., Shi, J., Yu, Y., Tang, K., Zhou, Z.: Optimizing ratio of monotone set functions. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pp. 2606\u20132612. Melbourne, Australia (2017)","key":"15_CR22","DOI":"10.24963\/ijcai.2017\/363"},{"unstructured":"Qian, C., Shi, J., Yu, Y., Tang, K., Zhou, Z.: Subset selection under noise. In: Advances in Neural Information Processing Systems (NeurIPS 2017), vol. 30, pp. 3560\u20133570. Long Beach, CA (2017)","key":"15_CR23"},{"doi-asserted-by":"crossref","unstructured":"Qian, C., Yu, Y., Tang, K.: Approximation guarantees of stochastic greedy algorithms for subset selection. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI 2018), pp. 1478\u20131484. Stockholm, Sweden (2018)","key":"15_CR24","DOI":"10.24963\/ijcai.2018\/205"},{"key":"15_CR25","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)","journal-title":"Artif. Intell."},{"unstructured":"Qian, C., Yu, Y., Zhou, Z.: Subset selection by Pareto optimization. In: Advances in Neural Information Processing Systems (NeurIPS 2015), vol. 28, pp. 1765\u20131773. Montreal, Canada (2015)","key":"15_CR26"},{"doi-asserted-by":"crossref","unstructured":"Qian, C., Zhang, Y., Tang, K., Yao, X.: On multiset selection with size constraints. In: Proceedings of the 32nd Conference on Artificial Intelligence (AAAI 2018), pp. 1395\u20131402. New Orleans, LA (2018)","key":"15_CR27","DOI":"10.1609\/aaai.v32i1.11524"},{"key":"15_CR28","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."},{"doi-asserted-by":"crossref","unstructured":"Rossi, R., Ahmed, N.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pp. 4292\u20134293. Austin,Texas (2015)","key":"15_CR29","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"6","key":"15_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-023-2740-6","volume":"17","author":"T Wu","year":"2023","unstructured":"Wu, T., Qian, H., Liu, Z., Zhou, J., Zhou, A.: Bi-objective evolutionary Bayesian network structure learning via skeleton constraint. Front. Comp. Sci. 17(6), 176350 (2023)","journal-title":"Front. Comp. Sci."},{"doi-asserted-by":"crossref","unstructured":"Zhang, H., Vorobeychik, Y.: Submodular optimization with routing constraints. In: Proceedings of the 30th Conference on Artificial Intelligence (AAAI 2016), pp. 819\u2013826. Phoenix, AZ (2016)","key":"15_CR31","DOI":"10.1609\/aaai.v30i1.10066"},{"doi-asserted-by":"crossref","unstructured":"Zhang, L., Sun, X., Yang, H., Cheng, F.: Sparsity preserved Pareto optimization for subset selection. IEEE Transactions on Evolutionary Computation (2023)","key":"15_CR32","DOI":"10.1109\/TEVC.2023.3281456"},{"doi-asserted-by":"publisher","unstructured":"Zhou, Z., Yu, Y., Qian, C.: Evolutionary Learning: Advances in Theories and Algorithms. Springer, Singapore (2019). https:\/\/doi.org\/10.1007\/978-981-13-5956-9","key":"15_CR33","DOI":"10.1007\/978-981-13-5956-9"}],"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-70085-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:43Z","timestamp":1725664483000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70085-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700842","9783031700859"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70085-9_15","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"}}]}}