{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:49Z","timestamp":1750220389972,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T00:00:00Z","timestamp":1625616000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"FCT - Foundation for Science and Technology"},{"name":"European Social Fund"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,7]]},"DOI":"10.1145\/3449726.3462737","type":"proceedings-article","created":{"date-parts":[[2021,7,8]],"date-time":"2021-07-08T14:50:12Z","timestamp":1625755812000},"page":"53-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A software library for archiving nondominated points"],"prefix":"10.1145","author":[{"given":"Duarte M.","family":"Dias","sequence":"first","affiliation":[{"name":"University of Coimbra, Coimbra, Portugal"}]},{"given":"Alexandre D.","family":"Jesus","sequence":"additional","affiliation":[{"name":"University of Coimbra, Coimbra, Portugal"}]},{"given":"Lu\u00eds","family":"Paquete","sequence":"additional","affiliation":[{"name":"University of Coimbra, Coimbra, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2021,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"R. Beier and B. V\u00f6cking. 2011. The Knapsack Problem. In Algorithms Unplugged B. V\u00f6cking et al. H. Alt M. Dietzfelbinger R. Reischuk C. Scheideler H. Vollmer and D. Wagner (Eds.). Springer 375--381.  R. Beier and B. V\u00f6cking. 2011. The Knapsack Problem. In Algorithms Unplugged B. V\u00f6cking et al. H. Alt M. Dietzfelbinger R. Reischuk C. Scheideler H. Vollmer and D. Wagner (Eds.). Springer 375--381.","DOI":"10.1007\/978-3-642-15328-0_39"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.4733027"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2799684"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321910"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00074"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/377939.377946"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0230-0"}],"event":{"name":"GECCO '21: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lille France","acronym":"GECCO '21"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449726.3462737","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449726.3462737","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:34Z","timestamp":1750191514000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449726.3462737"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,7]]},"references-count":7,"alternative-id":["10.1145\/3449726.3462737","10.1145\/3449726"],"URL":"https:\/\/doi.org\/10.1145\/3449726.3462737","relation":{},"subject":[],"published":{"date-parts":[[2021,7,7]]},"assertion":[{"value":"2021-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}