{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:33:32Z","timestamp":1730205212947,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/cec.2019.8789927","type":"proceedings-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:07Z","timestamp":1565308807000},"page":"1798-1805","source":"Crossref","is-referenced-by-count":2,"title":["The sum coloring problem: a memetic algorithm based on two individuals"],"prefix":"10.1109","author":[{"given":"Laurent","family":"Moalic","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Gondran","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/j.endm.2018.01.023"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1007\/s10732-017-9354-9"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/978-3-319-16468-7_15"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1007\/978-1-4684-2001-2_9"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1007\/BF02239976"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1023\/A:1009823419804"},{"key":"ref16","volume":"26","author":"johnson","year":"1996","journal-title":"Cliques Coloring and Satisfiability Second DIMACS Implementation Challenge 1993 ser DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"ref4","first-page":"lt","article-title":"Greedy Algorithms for the Minimum Sum Coloring Problem","author":"li","year":"2009","journal-title":"Logistique et transports"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1002\/jgt.3190130310"},{"year":"2013","author":"wu","article-title":"Improved lower bounds for sum coloring via clique decomposition","key":"ref6"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1016\/j.cor.2011.09.010"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1016\/j.asoc.2017.09.043"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1016\/j.cor.2013.09.019"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1016\/j.ins.2016.02.051"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/75427.75430"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1007\/s10462-016-9485-7"}],"event":{"name":"2019 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2019,6,10]]},"location":"Wellington, New Zealand","end":{"date-parts":[[2019,6,13]]}},"container-title":["2019 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8778428\/8789744\/08789927.pdf?arnumber=8789927","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T15:22:21Z","timestamp":1658157741000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8789927\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/cec.2019.8789927","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}