F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints, ECAI, p.146, 2004.

I. Cplex, High-performance software for mathematical programming and optimization, 2005.

S. De-givry, F. Heras, M. Zytnicki, and J. Larrosa, Existential arc consistency: Getting closer to full arc consistency in weighted csps, IJCAI, pp.84-89, 2005.

A. Helmar and M. Chiarandini, A local search heuristic for chromatic sum, Proceedings of the 9th metaheuristics international conference, pp.161-170, 2011.

Y. Jin, J. Hamiez, and J. Hao, Algorithms for the minimum sum coloring problem: a review, Artificial Intelligence Review, vol.160, issue.16???17, 2015.
DOI : 10.1007/s10462-016-9485-7
URL : https://hal.archives-ouvertes.fr/hal-01412512

Y. Jin, J. Hao, and J. Hamiez, A memetic algorithm for the Minimum Sum Coloring Problem, Computers & Operations Research, vol.43, pp.318-327, 2014.
DOI : 10.1016/j.cor.2013.09.019

N. Jussien, G. Rochart, and X. Lorca, Choco: an open source java constraint programming library, CPAIOR'08 Workshop on Open-Source Software for Integer and Contraint Programming (OSSICP'08), pp.1-10, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00483090

M. Kubale, Graph colorings, 2004.
DOI : 10.1090/conm/352

C. Lecat, C. M. Li, C. Lucet, and Y. Li, Comparaison de méthodes de résolution pour leprobì eme de somme coloration, JFPC'15: Journées Francophones de Programmation par Contraintes, 2015.

L. Michel and P. Van-hentenryck, Activitybased search for black-box constraint programming solvers, Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, pp.228-243, 2012.

A. Moukrim, C. Sghiouer, Y. Lucet, and . Li, Upper and lower bounds for the minimum sum coloring problem

A. Moukrim, K. Sghiouer, C. Lucet, and Y. Li, Lower Bounds for the Minimal Sum Coloring Problem, Electronic Notes in Discrete Mathematics, vol.36, pp.663-670, 2010.
DOI : 10.1016/j.endm.2010.05.084

M. Sanchez, . Bouveret, and . De-givry, Maxcsp competition 2008: toulbar2 solver description, Proceedings of the Third International CSP Solver Competition, pp.63-70, 2008.

G. Team, Gecode: Generic constraint development environment, 2006.

C. Thomassen, P. Erdös, Y. Alavi, P. Malde, and A. J. Schwenk, Tight bounds on the chromatic sum of a connected graph, Journal of Graph Theory, vol.13, issue.3, pp.353-357, 1989.
DOI : 10.1002/jgt.3190130310

Y. Wang, J. Hao, F. Glover, and Z. Lü, Solving the minimum sum coloring problem via binary quadratic programming. arXiv preprint arXiv, pp.1304-5876, 2013.

Q. Wu and J. Hao, An effective heuristic algorithm for sum coloring of graphs, Computers & Operations Research, vol.39, issue.7, pp.1593-1600, 2012.
DOI : 10.1016/j.cor.2011.09.010

Q. Wu and J. Hao, Improved lower bounds for sum coloring via clique decomposition. arXiv preprint, 2013.

J. Hao and Y. Jin, Hybrid evolutionary search for the minimum sum coloring problem of graphs, accepted to information sciences, 2015.