N. Beldiceanu, M. Carlsson, T. Petit, and J. C. Régin, An o (nlog n) bound consistency algorithm for the conjunction of an alldifferent and an inequality between a sum of variables and a constant, and its generalization, In: ECAI, vol.12, pp.145-150, 2012.

U. Benlic and J. K. Hao, A Study of Breakout Local Search for the Minimum Sum Coloring Problem, Simulated Evolution and Learning, pp.128-137, 2012.
DOI : 10.1007/978-3-642-34859-4_13

D. Givry, S. Schiex, T. Verfaillie, and G. , Exploiting tree decomposition and soft local consistency in weighted csp, In: AAAI, vol.6, pp.1-6, 2006.

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

P. Jégou and C. Terrioux, Hybrid backtracking bounded by tree-decomposition of constraint networks, Artificial Intelligence, vol.146, issue.1, pp.43-75, 2003.
DOI : 10.1016/S0004-3702(02)00400-9

P. Jégou, H. Kanso, and C. Terrioux, An Algorithmic Framework for Decomposing Constraint Networks, 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), pp.1-8, 2015.
DOI : 10.1109/ICTAI.2015.15

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

Y. Jin, J. P. Hamiez, and J. K. 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. K. Hao, and J. P. 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, pp.1-10, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00483090

U. Kjaerulff, Triangulation of graphs -algorithms giving small total state space, Tech. rep., Judex R.R. Aalborg, p.Denmark, 1990.

L. Kotthoff, Algorithm selection for combinatorial search problems: A survey. arXiv preprint arXiv:1210, p.7959, 2012.

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

A. Moukrim, K. Sghiouer, C. Lucet, and Y. Li, Upper and lower bounds for the minimum sum coloring problem, submitted for publication 17. Team, G.: Gecode: Generic constraint development environment, p.2006, 2008.

C. Thomassen, P. Erdös, Y. Alavi, P. J. 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. K. 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. K. 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. K. Hao, Improved lower bounds for sum coloring via clique decomposition . arXiv preprint arXiv:1303, p.6761, 2013.