D. Allouche, S. Givry, G. Katsirelos, T. Schiex, and M. Zytnicki, Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP, Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming, pp.12-29, 2015.
DOI : 10.1007/978-3-319-23219-5_2
URL : https://hal.archives-ouvertes.fr/hal-01198361

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.

C. P. Gomes and B. Selman, Algorithm portfolios, Artificial Intelligence, vol.126, issue.1-2, pp.43-62, 2001.
DOI : 10.1016/S0004-3702(00)00081-3

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

B. A. Huberman, R. M. Lukose, and T. Hogg, An Economics Approach to Hard Computational Problems, Science, vol.275, issue.5296, pp.51-54, 1997.
DOI : 10.1126/science.275.5296.51

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

S. Kadioglu, Y. Malitsky, M. Sellmann, and K. Tierney, Isac-instance-specific algorithm configuration, In: ECAI, vol.215, pp.751-756, 2010.

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

L. Kotthoff, LLAMA: Leveraging learning to automatically manage algorithms, 2013.

L. Kotthoff, Algorithm Selection for Combinatorial Search Problems: A Survey, AI Magazine, vol.17, issue.10, pp.48-60, 2014.
DOI : 10.1007/978-3-642-31612-8_18

L. Kotthoff, P. Kerschke, H. Hoos, and H. Trautmann, Improving the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection, p.9, 2015.
DOI : 10.1007/978-3-319-19084-6_18

L. Kotthoff, C. Mccreesh, and C. Solnon, Portfolios of Subgraph Isomorphism Algorithms, Learning and Intelligent OptimizatioN Conference, 2016.
DOI : 10.1007/978-3-319-10428-7_48
URL : https://hal.archives-ouvertes.fr/hal-01301829

C. Lecat, C. M. Li, C. Lucet, and Y. Li, Exact methods for the minimum sum coloring problem, DPCP-2015, pp.61-69, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01323741

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

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

O. 'mahony, E. Hebrard, E. Holland, A. Nugent, C. O-'sullivan et al., Using casebased reasoning in an algorithm portfolio for constraint solving, Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science, 2008.

J. R. Rice, The Algorithm Selection Problem, Advances in Computers, vol.15, pp.65-118, 1976.
DOI : 10.1016/S0065-2458(08)60520-3

N. Robertson and P. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4
URL : http://doi.org/10.1006/jctb.1996.0059

J. Seipp, M. Braun, J. Garimort, and M. Helmert, Learning portfolios of automatically tuned planners, p.ICAPS, 2012.

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

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.
DOI : 10.1007/s10878-016-9990-2

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.

L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-brown, SATzilla: Portfolio-based algorithm selection for SAT, J. Artif. Intell. Res. (JAIR), vol.32, pp.565-606, 2008.