{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:59:26Z","timestamp":1783749566712,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T00:00:00Z","timestamp":1562976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","award":["402956\/2016-8"],"award-info":[{"award-number":["402956\/2016-8"]}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","award":["00040-14"],"award-info":[{"award-number":["00040-14"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,13]]},"DOI":"10.1145\/3321707.3321872","type":"proceedings-article","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T13:48:04Z","timestamp":1562161684000},"page":"829-836","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Multi-heap constraint handling in gray box evolutionary algorithms"],"prefix":"10.1145","author":[{"given":"Thiago Macedo","family":"Gomes","sequence":"first","affiliation":[{"name":"Federal University of Ouro Preto, Minas Gerais, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alan Robert Resende","family":"de Freitas","sequence":"additional","affiliation":[{"name":"Federal University of Ouro Preto, Minas Gerais, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rodolfo Ayala","family":"Lopes","sequence":"additional","affiliation":[{"name":"Federal University of Ouro Preto, Minas Gerais, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205610"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908869"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00184"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598304"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205561"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071285"},{"key":"e_1_3_2_1_7_1","volume-title":"In Genetic and Evolutionary Computation Conference GECCO","author":"Gao Y.","year":"2003"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Bissan Ghaddar Miguel F. Anjos and Frauke Liers. 2011. A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem. In Annals of Operations Research. 155--174.  Bissan Ghaddar Miguel F. Anjos and Frauke Liers. 2011. A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem. In Annals of Operations Research. 155--174.","DOI":"10.1007\/s10479-008-0481-4"},{"key":"e_1_3_2_1_9_1","volume-title":"d.}. MINLPLib Instance Listing. ({n. d.}). Retrieved acessed","year":"2019"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3067695.3067706"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-5150(96)01217-0"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725497"},{"key":"e_1_3_2_1_13_1","unstructured":"R. Rivest T. Cormen C. Leiserson and C. Stein. 2009. Introduction to Algorithms. Computer science. MIT Press.   R. Rivest T. Cormen C. Leiserson and C. Stein. 2009. Introduction to Algorithms. Computer science. MIT Press."},{"key":"e_1_3_2_1_14_1","volume-title":"Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications","author":"Tawarmalani Mohit"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330351"}],"event":{"name":"GECCO '19: Genetic and Evolutionary Computation Conference","location":"Prague Czech Republic","acronym":"GECCO '19","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321872","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3321707.3321872","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:29Z","timestamp":1750206329000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321707.3321872"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,13]]},"references-count":15,"alternative-id":["10.1145\/3321707.3321872","10.1145\/3321707"],"URL":"https:\/\/doi.org\/10.1145\/3321707.3321872","relation":{},"subject":[],"published":{"date-parts":[[2019,7,13]]},"assertion":[{"value":"2019-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}