{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:39Z","timestamp":1750220079371,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T00:00:00Z","timestamp":1657324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,9]]},"DOI":"10.1145\/3520304.3529070","type":"proceedings-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T15:29:44Z","timestamp":1658244584000},"page":"340-343","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A computationally fast but approximate MIP-DoM calculation for multi-objective optimization"],"prefix":"10.1145","author":[{"given":"Claudio L. d. V.","family":"Lopes","sequence":"first","affiliation":[{"name":"PPMMC, MG, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fl\u00e1vio V. Cruzeiro","family":"Martins","sequence":"additional","affiliation":[{"name":"CEFET-MG, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth F.","family":"Wanner","sequence":"additional","affiliation":[{"name":"CEFET-MG, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kalyanmoy","family":"Deb","sequence":"additional","affiliation":[{"name":"Michigan State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"volume-title":"Assignment Problems","author":"Burkard Rainer","key":"e_1_3_2_1_1_1","unstructured":"Rainer Burkard, Mauro Dell'Amico, and Silvano Martello. 2012. Assignment Problems. Society for Industrial and Applied Mathematics, USA."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2895108"},{"key":"e_1_3_2_1_3_1","volume-title":"An Assignment Problem Formulation for Dominance Move Indicator. In 2020 IEEE Congress on Evolutionary Computation (CEC). 1--8.","author":"do Val Lopes Claudio Lucio","year":"2020","unstructured":"Claudio Lucio do Val Lopes, Fl\u00e1vio Vin\u00edcius Cruzeiro Martins, and Elizabeth Fialho Wanner. 2020. An Assignment Problem Formulation for Dominance Move Indicator. In 2020 IEEE Congress on Evolutionary Computation (CEC). 1--8."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Hisao Ishibuchi Hiroyuki Masuda Yuki Tanigaki and Yusuke Nojima. 2015. Modified Distance Calculation in Generational Distance and Inverted Generational Distance. (2015) 110--125.","DOI":"10.1007\/978-3-319-15892-1_8"},{"key":"e_1_3_2_1_5_1","volume-title":"Dominance Move: A Measure of Comparing Solution Sets in Multiobjective Optimization. CoRR abs\/1702.00477","author":"Li Miqing","year":"2017","unstructured":"Miqing Li and Xin Yao. 2017. Dominance Move: A Measure of Comparing Solution Sets in Multiobjective Optimization. CoRR abs\/1702.00477 (2017). arXiv:1702.00477 http:\/\/arxiv.org\/abs\/1702.00477"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3300148"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3096669"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2956963"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-019-00798-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108564175"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"}],"event":{"name":"GECCO '22: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Boston Massachusetts","acronym":"GECCO '22"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3529070","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3520304.3529070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:22Z","timestamp":1750183762000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3529070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,9]]},"references-count":11,"alternative-id":["10.1145\/3520304.3529070","10.1145\/3520304"],"URL":"https:\/\/doi.org\/10.1145\/3520304.3529070","relation":{},"subject":[],"published":{"date-parts":[[2022,7,9]]},"assertion":[{"value":"2022-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}