{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:54:43Z","timestamp":1750308883570,"version":"3.41.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319597751"},{"type":"electronic","value":"9783319597768"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59776-8_29","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T13:26:33Z","timestamp":1496150793000},"page":"359-375","source":"Crossref","is-referenced-by-count":0,"title":["Combining CP and ILP in a Tree Decomposition of Bounded Height for the Sum Colouring Problem"],"prefix":"10.1007","author":[{"given":"Ma\u00ebl","family":"Minot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samba Ndojh","family":"Ndiaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-319-23219-5_2","volume-title":"Principles and Practice of Constraint Programming","author":"D Allouche","year":"2015","unstructured":"Allouche, D., Givry, S., Katsirelos, G., Schiex, T., Zytnicki, M.: Anytime hybrid best-first search with tree decomposition for weighted CSP. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 12\u201329. Springer, Cham (2015). doi: 10.1007\/978-3-319-23219-5_2"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., Petit, T., R\u00e9gin, J.C.: 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\u2013150 (2012)","DOI":"10.3233\/978-1-61499-098-7-145"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-34859-4_13","volume-title":"Simulated Evolution and Learning","author":"U Benlic","year":"2012","unstructured":"Benlic, U., Hao, J.-K.: A study of breakout local search for the minimum sum coloring problem. In: Bui, L.T., Ong, Y.S., Hoai, N.X., Ishibuchi, H., Suganthan, P.N. (eds.) SEAL 2012. LNCS, vol. 7673, pp. 128\u2013137. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-34859-4_13"},{"key":"29_CR4","unstructured":"Cplex, I.: High-performance software for mathematical programming and optimization (2005)"},{"key":"29_CR5","unstructured":"De Givry, S., Schiex, T., Verfaillie, G.: Exploiting tree decomposition and soft local consistency in weighted CSP. In: AAAI, vol. 6, pp. 1\u20136 (2006)"},{"issue":"1\u20132","key":"29_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"CP Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artif. Intell. 126(1\u20132), 43\u201362 (2001)","journal-title":"Artif. Intell."},{"key":"29_CR7","unstructured":"Helmar, A., Chiarandini, M.: A local search heuristic for chromatic sum. In: Proceedings of the 9th Metaheuristics International Conference, vol. 1101, pp. 161\u2013170 (2011)"},{"issue":"5296","key":"29_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"275","author":"BA Huberman","year":"1997","unstructured":"Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Sci. 275(5296), 51\u201354 (1997)","journal-title":"Sci."},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(02)00400-9","volume":"146","author":"P J\u00e9gou","year":"2003","unstructured":"J\u00e9gou, P., Terrioux, C.: Hybrid backtracking bounded by tree-decomposition of constraint networks. Artif. Intell. 146, 43\u201375 (2003)","journal-title":"Artif. Intell."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"J\u00e9gou, P., Kanso, H., Terrioux, C.: An algorithmic framework for decomposing constraint networks. In: 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 1\u20138. IEEE (2015)","DOI":"10.1109\/ICTAI.2015.15"},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ins.2016.02.051","volume":"352","author":"Y Jin","year":"2016","unstructured":"Jin, Y., Hao, J.K.: Hybrid evolutionary search for the minimum sum coloring problem of graphs. Inf. Sci. 352, 15\u201334 (2016)","journal-title":"Inf. Sci."},{"key":"29_CR12","unstructured":"Jin, Y., Hamiez, J.P., Hao, J.K.: Algorithms for the minimum sum coloring problem: a review (2015). arXiv:1505.00449"},{"key":"29_CR13","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.cor.2013.09.019","volume":"43","author":"Y Jin","year":"2014","unstructured":"Jin, Y., Hao, J.K., Hamiez, J.P.: A memetic algorithm for the minimum sum coloring problem. Comput. Oper. Res. 43, 318\u2013327 (2014)","journal-title":"Comput. Oper. Res."},{"key":"29_CR14","unstructured":"Jussien, N., Rochart, G., Lorca, X.: Choco: an open source java constraint programming library. In: CPAIOR 2008 Workshop on Open-Source Software for Integer and Contraint Programming (OSSICP 2008), pp. 1\u201310 (2008)"},{"key":"29_CR15","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: Isac-instance-specific algorithm configuration. In: ECAI, vol. 215, pp. 751\u2013756 (2010)"},{"key":"29_CR16","unstructured":"Kjaerulff, U.: Triangulation of graphs - algorithms giving small total state space. Technical report, Judex R.R. Aalborg, Denmark (1990)"},{"key":"29_CR17","unstructured":"Kotthoff, L.: LLAMA: Leveraging learning to automatically manage algorithms. Technical report, June 2013. http:\/\/arxiv.org\/abs\/1306.1031"},{"issue":"3","key":"29_CR18","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1609\/aimag.v35i3.2460","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag. 35(3), 48\u201360 (2014)","journal-title":"AI Mag."},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-19084-6_18","volume-title":"Learning and Intelligent Optimization","author":"L Kotthoff","year":"2015","unstructured":"Kotthoff, L., Kerschke, P., Hoos, H., Trautmann, H.: Improving the state of the art in inexact TSP solving using per-instance algorithm selection. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 202\u2013217. Springer, Cham (2015). doi: 10.1007\/978-3-319-19084-6_18"},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-319-50349-3_8","volume-title":"Learning and Intelligent Optimization","author":"L Kotthoff","year":"2016","unstructured":"Kotthoff, L., McCreesh, C., Solnon, C.: Portfolios of subgraph isomorphism algorithms. In: Festa, P., Sellmann, M., Vanschoren, J. (eds.) LION 2016. LNCS, vol. 10079, pp. 107\u2013122. Springer, Cham (2016). doi: 10.1007\/978-3-319-50349-3_8"},{"key":"29_CR21","doi-asserted-by":"crossref","DOI":"10.1090\/conm\/352","volume-title":"Graph Colorings","author":"M Kubale","year":"2004","unstructured":"Kubale, M.: Graph Colorings, vol. 352. American Mathematical Society, Canada (2004)"},{"key":"29_CR22","unstructured":"Lecat, C., Li, C.M., Lucet, C., Li, Y.: Exact methods for the minimum sum coloring problem. In: DPCP-2015, Cork, Ireland, Iran, pp. 61\u201369 (2015). https:\/\/hal.archives-ouvertes.fr\/hal-01323741"},{"key":"29_CR23","unstructured":"Moukrim, A., Sghiouer, K., Lucet, C., Li, Y.: Upper and lower bounds for the minimum sum coloring problem (Submitted for Publication)"},{"key":"29_CR24","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/j.endm.2010.05.084","volume":"36","author":"A Moukrim","year":"2010","unstructured":"Moukrim, A., Sghiouer, K., Lucet, C., Li, Y.: Lower bounds for the minimal sum coloring problem. Electron. Notes Discrete Math. 36, 663\u2013670 (2010)","journal-title":"Electron. Notes Discrete Math."},{"key":"29_CR25","unstructured":"O\u2019Mahony, E., Hebrard, E., Holland, A., Nugent, C., O\u2019Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science, January 2008"},{"key":"29_CR26","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"29_CR27","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.: Graph minors II: algorithmic aspects of tree-width. J. Algorithms 7, 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Seipp, J., Braun, M., Garimort, J., Helmert, M.: Learning portfolios of automatically tuned planners. In: ICAPS (2012)","DOI":"10.1609\/icaps.v22i1.13538"},{"key":"29_CR29","unstructured":"Team, G.: Gecode: generic constraint development environment (2006, 2008)"},{"issue":"3","key":"29_CR30","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/jgt.3190130310","volume":"13","author":"C Thomassen","year":"1989","unstructured":"Thomassen, C., Erd\u00f6s, P., Alavi, Y., Malde, P.J., Schwenk, A.J.: Tight bounds on the chromatic sum of a connected graph. J. Graph Theor. 13(3), 353\u2013357 (1989)","journal-title":"J. Graph Theor."},{"key":"29_CR31","unstructured":"Wang, Y., Hao, J.K., Glover, F., L\u00fc, Z.: Solving the minimum sum coloring problem via binary quadratic programming (2013). arXiv:1304.5876"},{"issue":"7","key":"29_CR32","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1016\/j.cor.2011.09.010","volume":"39","author":"Q Wu","year":"2012","unstructured":"Wu, Q., Hao, J.K.: An effective heuristic algorithm for sum coloring of graphs. Comput. Oper. Res. 39(7), 1593\u20131600 (2012)","journal-title":"Comput. Oper. Res."},{"key":"29_CR33","unstructured":"Wu, Q., Hao, J.K.: Improved lower bounds for sum coloring via clique decomposition. arXiv preprint (2013). arXiv:1303.6761"},{"key":"29_CR34","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59776-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:20:08Z","timestamp":1750281608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59776-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597751","9783319597768"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59776-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}