{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:41Z","timestamp":1720640801139},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1016\/j.endm.2018.03.008","type":"journal-article","created":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T11:23:19Z","timestamp":1523532199000},"page":"55-62","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["On integrating an Iterated Variable Neighborhood Search within a bi-objective Genetic Algorithm: Sum Coloring of Graphs Case Application"],"prefix":"10.1016","volume":"66","author":[{"given":"Olfa","family":"Harrabi","sequence":"first","affiliation":[]},{"given":"Jouhaina Chaouachi","family":"Siala","sequence":"additional","affiliation":[]},{"given":"Hend","family":"Bouziri","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2018.03.008_br0010","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/inco.1997.2677","article-title":"On chromatic sums and distributed resource allocation","volume":"140","author":"Bar-Noy","year":"1998","journal-title":"Information and Computation"},{"key":"10.1016\/j.endm.2018.03.008_br0020","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1006\/jagm.1998.0938","article-title":"Minimum color sum of bipartite graphs","volume":"28","author":"Bar-Noy","year":"1998","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.endm.2018.03.008_br0030","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.dam.2010.11.018","article-title":"Minimum sum set coloring of trees and line graphs of trees","volume":"159","author":"Bonomo","year":"2011","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.endm.2018.03.008_br0040","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","article-title":"Hybrid evolutionary algorithms for graph coloring","volume":"3","author":"Galinier","year":"1999","journal-title":"Journal of combinatorial optimization"},{"key":"10.1016\/j.endm.2018.03.008_br0050","series-title":"International Workshop on Approximation and Online Algorithms","first-page":"68","article-title":"Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria","author":"Gandhi","year":"2004"},{"key":"10.1016\/j.endm.2018.03.008_br0060","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","article-title":"Variable neighborhood search: Principles and applications","volume":"130","author":"Hansen","year":"2001","journal-title":"European journal of operational research"},{"key":"10.1016\/j.endm.2018.03.008_br0070","first-page":"1","article-title":"Algorithms for the minimum sum coloring problem: a review","author":"Jin","year":"2016","journal-title":"Artificial Intelligence Review"},{"key":"10.1016\/j.endm.2018.03.008_br0080","series-title":"International Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"279","article-title":"The optimal cost chromatic partition problem for trees and interval graphs","author":"Kroon","year":"1996"},{"key":"10.1016\/j.endm.2018.03.008_br0090","series-title":"Proceedings of the 17th conference on ACM Annual Computer Science Conference","first-page":"39","article-title":"An introduction to chromatic sums","author":"Kubicka","year":"1989"},{"key":"10.1016\/j.endm.2018.03.008_br0100","series-title":"Proceedings of the 17th conference on ACM Annual Computer Science Conference","first-page":"39","article-title":"An introduction to chromatic sums","author":"Kubicka","year":"1989"},{"key":"10.1016\/j.endm.2018.03.008_br0110","unstructured":"A. Moukrim, K. Sghiouer, C. Lucet, Y. Li, Upper and lower bounds for the minimum sum coloring problem, 2014, submitted for publication."},{"key":"10.1016\/j.endm.2018.03.008_br0120","series-title":"Proceedings of the 1st international Conference on Genetic Algorithms","first-page":"93","article-title":"Multiple objective optimization with vector evaluated genetic algorithms","author":"Schaffer","year":"1985"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300544?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300544?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T10:24:22Z","timestamp":1534933462000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065318300544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":12,"alternative-id":["S1571065318300544"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2018.03.008","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2018,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On integrating an Iterated Variable Neighborhood Search within a bi-objective Genetic Algorithm: Sum Coloring of Graphs Case Application","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.endm.2018.03.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}