{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T22:11:38Z","timestamp":1783980698039,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,14]]},"DOI":"10.1145\/3712255.3734229","type":"proceedings-article","created":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T15:14:02Z","timestamp":1754925242000},"page":"25-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Hot off the Press: Speeding Up the NSGA-II With a Simple Tie-Breaking Rule"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9786-220X","authenticated-orcid":false,"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"},{"name":"Laboratoire d'Informatique (LIX), Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5699-5385","authenticated-orcid":false,"given":"Tudor","family":"Ivan","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1765-1219","authenticated-orcid":false,"given":"Martin","family":"Krejca","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"PPSN","author":"Bian Chao","year":"2022","unstructured":"Chao Bian and Chao Qian. 2022. Better running time of the non-dominated sorting genetic algorithm II (NSGA-II) by using stochastic tournament selection. In Parallel Problem Solving From Nature, PPSN 2022. Springer, 428\u2013441."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/613"},{"key":"e_1_3_2_1_3_1","volume-title":"van Veldhuizen","author":"Coello Coello Carlos Artemio","year":"2007","unstructured":"Carlos Artemio Coello Coello, Gary B. Lamont, and David A. van Veldhuizen. 2007. Evolutionary Algorithms for Solving Multi-Objective Problems (2nd ed.). Springer."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104098"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583131.3590421"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_3_2_1_7_1","volume-title":"PPSN","author":"Deng Renzhong","year":"2024","unstructured":"Renzhong Deng, Weijie Zheng, Mingfeng Li, Jie Liu, and Benjamin Doerr. 2024. Runtime analysis for state-of-the-art multi-objective evolutionary algorithms on the subset selection problem. In Parallel Problem Solving from Nature, PPSN 2024, Part III. Springer, 264\u2013279."},{"key":"e_1_3_2_1_8_1","volume-title":"Conference on Artificial Intelligence, AAAI","author":"Doerr Benjamin","year":"2025","unstructured":"Benjamin Doerr, Tudor Ivan, and Martin S. Krejca. 2025. Speeding up the NSGA-II with a simple tie-breaking rule. In Conference on Artificial Intelligence, AAAI 2025. AAAI Press, 26964\u201326972."},{"key":"e_1_3_2_1_9_1","volume-title":"Krejca","author":"Doerr Benjamin","year":"2024","unstructured":"Benjamin Doerr, Dimitri Korkotashvili, and Martin S. Krejca. 2024. Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem. CoRR abs\/2411.10017 (2024). arXiv:2411.10017"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.03.015"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Benjamin Doerr and Frank Neumann (Eds.). 2020. Theory of Evolutionary Computation\u2014Recent Developments in Discrete Optimization. Springer.","DOI":"10.1007\/978-3-030-29414-4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3250552"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26462"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26461"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463456"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299908"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666921"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45712-7_5"},{"key":"e_1_3_2_1_19_1","volume-title":"EMO","author":"Thierens Dirk","year":"2003","unstructured":"Dirk Thierens. 2003. Convergence time analysis for the multi-objective counting ones problem. In Evolutionary Multi-Criterion Optimization, EMO 2003. Springer, 355\u2013364."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365606776022751"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2024.3402996"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3320278"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3520304.3534070"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.03.001"}],"event":{"name":"GECCO '25 Companion: Genetic and Evolutionary Computation Conference Companion","location":"NH Malaga Hotel Malaga Spain","acronym":"GECCO '25 Companion","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712255.3734229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:46:51Z","timestamp":1759837611000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712255.3734229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,14]]},"references-count":24,"alternative-id":["10.1145\/3712255.3734229","10.1145\/3712255"],"URL":"https:\/\/doi.org\/10.1145\/3712255.3734229","relation":{},"subject":[],"published":{"date-parts":[[2025,7,14]]},"assertion":[{"value":"2025-08-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}