@article{
 title = {A memetic algorithm for the Minimum Sum Coloring Problem},
 type = {article},
 year = {2014},
 identifiers = {[object Object]},
 keywords = {Combinatorial optimization,Heuristics,Memetic algorithm,Sum coloring},
 pages = {318-327},
 volume = {43},
 websites = {http://linkinghub.elsevier.com/retrieve/pii/S030505481300292X},
 month = {3},
 publisher = {Elsevier},
 id = {aa995735-a229-396e-8594-e4d20d724657},
 created = {2015-03-23T18:50:28.000Z},
 accessed = {2014-10-31},
 file_attached = {true},
 profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},
 group_id = {1f5b486a-d8ac-3a35-9104-56111360dab7},
 last_modified = {2017-03-14T11:36:44.206Z},
 read = {true},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 citation_key = {Jin2014},
 private_publication = {false},
 abstract = {Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of G such that the total sum of the colors assigned to the vertices is minimized. This paper presents a memetic algorithm for MSCP based on a tabu search procedure with two neighborhoods and a multi-parent crossover operator. Experiments on a set of 77 well-known DIMACS and COLOR 2002-2004 benchmark instances show that the proposed algorithm achieves highly competitive results in comparison with five state-of-the-art algorithms. In particular, the proposed algorithm can improve the best known results for 15 instances. ?? 2013 Elsevier Ltd. All rights reserved.},
 bibtype = {article},
 author = {Jin, Yan and Hao, Jin Kao and Hamiez, Jean Philippe},
 journal = {Computers and Operations Research}
}

{"_id":"Dub2hGFjSbA3GxnfA","bibbaseid":"jin-hao-hamiez-amemeticalgorithmfortheminimumsumcoloringproblem-2014","downloads":0,"creationDate":"2018-03-26T07:07:40.713Z","title":"A memetic algorithm for the Minimum Sum Coloring Problem","author_short":["Jin, Y.","Hao, J., K.","Hamiez, J., P."],"year":2014,"bibtype":"article","biburl":null,"bibdata":{"title":"A memetic algorithm for the Minimum Sum Coloring Problem","type":"article","year":"2014","identifiers":"[object Object]","keywords":"Combinatorial optimization,Heuristics,Memetic algorithm,Sum coloring","pages":"318-327","volume":"43","websites":"http://linkinghub.elsevier.com/retrieve/pii/S030505481300292X","month":"3","publisher":"Elsevier","id":"aa995735-a229-396e-8594-e4d20d724657","created":"2015-03-23T18:50:28.000Z","accessed":"2014-10-31","file_attached":"true","profile_id":"756a70ce-605d-3e50-9cbb-a99c29afcbe8","group_id":"1f5b486a-d8ac-3a35-9104-56111360dab7","last_modified":"2017-03-14T11:36:44.206Z","read":"true","starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"Jin2014","private_publication":false,"abstract":"Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of G such that the total sum of the colors assigned to the vertices is minimized. This paper presents a memetic algorithm for MSCP based on a tabu search procedure with two neighborhoods and a multi-parent crossover operator. Experiments on a set of 77 well-known DIMACS and COLOR 2002-2004 benchmark instances show that the proposed algorithm achieves highly competitive results in comparison with five state-of-the-art algorithms. In particular, the proposed algorithm can improve the best known results for 15 instances. ?? 2013 Elsevier Ltd. All rights reserved.","bibtype":"article","author":"Jin, Yan and Hao, Jin Kao and Hamiez, Jean Philippe","journal":"Computers and Operations Research","bibtex":"@article{\n title = {A memetic algorithm for the Minimum Sum Coloring Problem},\n type = {article},\n year = {2014},\n identifiers = {[object Object]},\n keywords = {Combinatorial optimization,Heuristics,Memetic algorithm,Sum coloring},\n pages = {318-327},\n volume = {43},\n websites = {http://linkinghub.elsevier.com/retrieve/pii/S030505481300292X},\n month = {3},\n publisher = {Elsevier},\n id = {aa995735-a229-396e-8594-e4d20d724657},\n created = {2015-03-23T18:50:28.000Z},\n accessed = {2014-10-31},\n file_attached = {true},\n profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},\n group_id = {1f5b486a-d8ac-3a35-9104-56111360dab7},\n last_modified = {2017-03-14T11:36:44.206Z},\n read = {true},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Jin2014},\n private_publication = {false},\n abstract = {Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of G such that the total sum of the colors assigned to the vertices is minimized. This paper presents a memetic algorithm for MSCP based on a tabu search procedure with two neighborhoods and a multi-parent crossover operator. Experiments on a set of 77 well-known DIMACS and COLOR 2002-2004 benchmark instances show that the proposed algorithm achieves highly competitive results in comparison with five state-of-the-art algorithms. In particular, the proposed algorithm can improve the best known results for 15 instances. ?? 2013 Elsevier Ltd. All rights reserved.},\n bibtype = {article},\n author = {Jin, Yan and Hao, Jin Kao and Hamiez, Jean Philippe},\n journal = {Computers and Operations Research}\n}","author_short":["Jin, Y.","Hao, J., K.","Hamiez, J., P."],"urls":{"Paper":"https://bibbase.org/service/mendeley/756a70ce-605d-3e50-9cbb-a99c29afcbe8/file/299e429a-b730-4b01-4bf2-5f37c9b9c5b0/2014-A_memetic_algorithm_for_the_Minimum_Sum_Coloring_Problem.pdf.pdf","Website":"http://linkinghub.elsevier.com/retrieve/pii/S030505481300292X"},"bibbaseid":"jin-hao-hamiez-amemeticalgorithmfortheminimumsumcoloringproblem-2014","role":"author","keyword":["Combinatorial optimization","Heuristics","Memetic algorithm","Sum coloring"],"downloads":0},"search_terms":["memetic","algorithm","minimum","sum","coloring","problem","jin","hao","hamiez"],"keywords":["combinatorial optimization","heuristics","memetic algorithm","sum coloring"],"authorIDs":[]}