{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T23:56:29Z","timestamp":1794527789608,"version":"4.9.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449524","type":"print"},{"value":"9783319449531","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_25","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"388-404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Parallel Strategies Selection"],"prefix":"10.1007","author":[{"given":"Anthony","family":"Palmieri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Charles","family":"R\u00e9gin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Arbelaez, A., Hamadi, Y., Sebag, M.: Online heuristic selection in constraint programming. In: International Symposium on Combinatorial Search (2009)","DOI":"10.1109\/ICTAI.2010.17"},{"issue":"2\u20133","key":"25_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2\u20133), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"25_CR3","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, USA, 9\u201313 July 2002, pp. 11\u201318 (2002)"},{"key":"25_CR4","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C.: Revision ordering heuristics for the constraint satisfaction problem. In: 1st International Workshop on Constraint Propagation and Implementation held with CP 2004 (CPAI 2004), pp. 9\u201343, Toronto, Canada, September 2004"},{"key":"25_CR5","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI, vol. 16, p. 146 (2004)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/3-540-46135-3_35","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"SL Epstein","year":"2002","unstructured":"Epstein, S.L., Freuder, E.C., Wallace, R.J., Morozov, A., Samuels, B.: The adaptive constraint engine. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 525\u2013542. Springer, Heidelberg (2002)"},{"issue":"3\u20134","key":"25_CR7","first-page":"295","volume":"47","author":"M Gagliolo","year":"2006","unstructured":"Gagliolo, M., Schmidhuber, J.: Learning dynamic algorithm portfolios. Ann. Math. Artif. Intell. 47(3\u20134), 295\u2013328 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-319-23219-5_10","volume-title":"Principles and Practice of Constraint Programming","author":"S Gay","year":"2015","unstructured":"Gay, S., Hartert, R., Lecoutre, C., Schaus, P.: Conflict ordering search for scheduling problems. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 140\u2013148. Springer, Heidelberg (2015)"},{"key":"25_CR9","unstructured":"Gecode (2012). \n                      http:\/\/www.gecode.org\/"},{"issue":"1\u20132","key":"25_CR10","doi-asserted-by":"publisher","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":"25_CR11","doi-asserted-by":"crossref","unstructured":"Hamadi, Y., Search, C.: From Algorithms to Systems. Springer (2013)","DOI":"10.1007\/978-3-642-41482-4"},{"issue":"4","key":"25_CR12","first-page":"245","volume":"6","author":"Y Hamadi","year":"2009","unstructured":"Hamadi, Y., Jabbour, S., Sais, L.: Manysat: a parallel SAT solver. JSAT 6(4), 245\u2013262 (2009)","journal-title":"JSAT"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Haralick","year":"1980","unstructured":"Haralick, R.M., Elliot, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14, 263\u2013313 (1980)","journal-title":"Artif. Intell."},{"key":"25_CR14","unstructured":"Kjellerstrand, H.: My constraint programming blog (2016)"},{"key":"25_CR15","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. arXiv preprint. \n                      arXiv:1210.7959\n                      \n                     (2012)"},{"key":"25_CR16","unstructured":"Kotthoff, L.: Algorithm selection literature summary (2016). \n                      http:\/\/larskotthoff.github.io\/assurvey"},{"key":"25_CR17","unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Last conflict based reasoning. In: ECAI, pp. 133\u2013137 (2006)"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-642-40627-0_36","volume-title":"Principles and Practice of Constraint Programming","author":"M Loth","year":"2013","unstructured":"Loth, M., Sebag, M., Hamadi, Y., Schoenauer, M.: Bandit-based search for constraint programming. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 464\u2013480. Springer, Heidelberg (2013)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-29828-8_15","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"L Michel","year":"2012","unstructured":"Michel, L., Van Hentenryck, P.: Activity-based search for black-box constraint programming solvers. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 228\u2013243. Springer, Heidelberg (2012)"},{"key":"25_CR20","unstructured":"MiniZinc (2012). \n                      http:\/\/www.g12.csse.unimelb.edu.au\/minizinc\/"},{"key":"25_CR21","volume-title":"Introduction to the Practice of Statistics: Extended Version","author":"DS Moore","year":"2009","unstructured":"Moore, D.S., McCabe, G.P., Craig, B.A.: Introduction to the Practice of Statistics: Extended Version. W.H. Freeman, New York (2009)"},{"key":"25_CR22","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: Irish Conference on Artificial Intelligence and Cognitive Science, pp. 210\u2013216 (2008)"},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P Refalo","year":"2004","unstructured":"Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557\u2013571. Springer, Heidelberg (2004)"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-642-40627-0_45","volume-title":"Principles and Practice of Constraint Programming","author":"J-C R\u00e9gin","year":"2013","unstructured":"R\u00e9gin, J.-C., Rezgui, M., Malapert, A.: Embarrassingly parallel search. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 596\u2013610. Springer, Heidelberg (2013)"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1007\/978-3-319-10428-7_45","volume-title":"Principles and Practice of Constraint Programming","author":"J-C R\u00e9gin","year":"2014","unstructured":"R\u00e9gin, J.-C., Rezgui, M., Malapert, A.: Improvement of the embarrassingly parallel search for data centers. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 622\u2013635. Springer, Heidelberg (2014)"},{"key":"25_CR26","doi-asserted-by":"publisher","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":"25_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/978-3-319-18008-3_30","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"P Vil\u00edm","year":"2015","unstructured":"Vil\u00edm, P., Laborie, P., Shaw, P.: Failure-directed search for constraint-based scheduling. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 437\u2013453. Springer, Heidelberg (2015)"},{"key":"25_CR28","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"X Lin","year":"2008","unstructured":"Lin, X., 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","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:55:08Z","timestamp":1558313708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_25","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"23 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}