{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T22:21:35Z","timestamp":1787437295215,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":21,"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_9","type":"book-chapter","created":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T21:45:00Z","timestamp":1787435100000},"page":"135-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Evolutionary Algorithms and\u00a0Multi-objective Minimum Spanning Trees with\u00a0Limited Distinct Weight Values"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-7529-2298","authenticated-orcid":false,"given":"Narges","family":"Tavassoli Kejani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1295-6715","authenticated-orcid":false,"given":"Andrew M.","family":"Sutton","sequence":"additional","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":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1162\/evco_a_00335","volume":"32","author":"J Bossek","year":"2024","unstructured":"Bossek, J., Grimme, C.: On single-objective sub-graph-based mutation for solving the bi-objective minimum spanning tree problem. Evol. Comput. 32(2), 143\u2013175 (2024)","journal-title":"Evol. Comput."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Cerf, S., Doerr, B., Hebras, B., Kahane, Y., Wietheger, S.: The first proven performance guarantees for the non-dominated sorting genetic algorithm II (NSGA-II) on a combinatorial optimization problem. In: IJCAI, pp. 5522\u20135530. ijcai.org (2023)","DOI":"10.24963\/ijcai.2023\/613"},{"key":"9_CR3","unstructured":"Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. Wiley-Interscience Series in Systems and Optimization. Wiley (2001)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Do, A.V., Neumann, A., Neumann, F., Sutton, A.M.: Rigorous runtime analysis of MOEA\/D for solving multi-objective minimum weight base problems. In: NeurIPS (2023)","DOI":"10.52202\/075280-1581"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Doerr, B., Neumann, F.: Theory of Evolutionary Computation - Recent Developments in Discrete Optimization. Natural Computing Series. Springer (2020)","DOI":"10.1007\/978-3-030-29414-4"},{"key":"9_CR6","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005)","edition":"2"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1162\/EVCO_a_00003","volume":"18","author":"T Friedrich","year":"2010","unstructured":"Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models. Evol. Comput. 18(4), 617\u2013633 (2010)","journal-title":"Evol. Comput."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Giel, O.: Expected runtimes of a simple multi-objective evolutionary algorithm. In: Proceedings of the 2003 Congress on Evolutionary Computation (CEC 2003), pp. 1918\u20131925. IEEE (2003)","DOI":"10.1109\/CEC.2003.1299908"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1162\/EVCO_a_00014","volume":"18","author":"C Horoba","year":"2010","unstructured":"Horoba, C.: Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem. Evol. Comput. 18(3), 357\u2013381 (2010)","journal-title":"Evol. Comput."},{"key":"9_CR10","unstructured":"Kejani, N.T., Sutton, A.M., Neumann, F.: Evolutionary algorithms and multi-objective minimum spanning trees with limited distinct weight values (2026). https:\/\/arxiv.org\/abs\/2606.17731"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Knowles, J.D., Corne, D.W.: A comparison of encodings and algorithms for multiobjective minimum spanning tree problems. In: CEC, pp. 544\u2013551. IEEE (2001)","DOI":"10.1109\/CEC.2001.934439"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Knowles, J.D., Watson, R.A., Corne, D.: Reducing local optima in single-objective problems by multi-objectivization. In: Proceedings of International Conference on Evolutionary Multi-Criterion Optimization (EMO\u00a01993), pp. 269\u2013283. Springer (2001)","DOI":"10.1007\/3-540-44719-9_19"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1007\/s00453-012-9660-4","volume":"65","author":"S Kratsch","year":"2013","unstructured":"Kratsch, S., Neumann, F.: Fixed-parameter evolutionary algorithms and the vertex cover problem. Algorithmica 65(4), 754\u2013771 (2013)","journal-title":"Algorithmica"},{"issue":"2","key":"9_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."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Neumann, F.: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem. In: PPSN. Lecture Notes in Computer Science, pp. 81\u201390. Springer (2004)","DOI":"10.1007\/978-3-540-30217-9_9"},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.ejor.2006.08.005","volume":"181","author":"F Neumann","year":"2007","unstructured":"Neumann, F.: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem. Eur. J. Oper. Res. 181(3), 1620\u20131629 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s11047-006-9004-x","volume":"5","author":"F Neumann","year":"2006","unstructured":"Neumann, F., Wegener, I.: Minimum spanning trees made easier via multi-objective optimization. Nat. Comput. 5(3), 305\u2013319 (2006)","journal-title":"Nat. Comput."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Opris, A.: Many-objective problems where crossover is provably essential. Artif. Intell. 350, 104453 (2026)","DOI":"10.1016\/j.artint.2025.104453"},{"key":"9_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.-X., 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":"9_CR20","doi-asserted-by":"crossref","unstructured":"Zheng, W., Doerr, B.: Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II). Artif. Intell. 325, 104016 (2023)","DOI":"10.1016\/j.artint.2023.104016"},{"issue":"1","key":"9_CR21","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0377-2217(98)00016-2","volume":"114","author":"G Zhou","year":"1999","unstructured":"Zhou, G., Gen, M.: Genetic algorithm approach on multi-criteria minimum spanning tree problem. Eur. J. Oper. Res. 114(1), 141\u2013152 (1999)","journal-title":"Eur. J. Oper. Res."}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T21:45:01Z","timestamp":1787435101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-36223-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,23]]},"ISBN":["9783032362223","9783032362230"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-36223-0_9","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"}}]}}