{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:17:15Z","timestamp":1648765035389},"reference-count":26,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1051\/ro:2007004","type":"journal-article","created":{"date-parts":[[2007,2,13]],"date-time":"2007-02-13T09:18:42Z","timestamp":1171358322000},"page":"381-401","source":"Crossref","is-referenced-by-count":0,"title":["Des explications pour reconna\u00eetre et exploiter les structures cach\u00e9es d'un probl\u00e8me combinatoire"],"prefix":"10.1051","volume":"40","author":[{"given":"Hadrien","family":"Cambazard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narendra","family":"Jussien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2007,2,14]]},"reference":[{"key":"R1","unstructured":"D. Achlioptas, L. Kirousis, E. Kranakis, D. Krizanc, M. Molloy and Y. Stamatiou, Random constraint satisfaction: a more accurate picture, inProceedings CP 1997, Linz, Austria (1997) 121\u2013135."},{"key":"R2","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"Benders","year":"1962","journal-title":"Numer. Math."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"C. Bessi\u00e8re, A. Chmeiss and L. Sa\u00efs, Neighborhood-based variable ordering heuristics for the constraint satisfaction problem, inProceeding CP'01, Paphos, Cyprus (2001) 565\u2013569. Short paper.","DOI":"10.1007\/3-540-45578-7_40"},{"key":"R4","unstructured":"C. Bessiere and J.C. Regin, MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems, inProceeding CP'96(1996) 61\u201375."},{"key":"R5","unstructured":"F. Boussemart, F. Hemery, C. Lecoutre and L. Sais, Boosting systematic search by weighting constraints, inProceedings ECAI'04(2004) 482\u2013486."},{"key":"R6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1009812409930","volume":"4","author":"Cabon","year":"1999","journal-title":"Constraints"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"H. Cambazard, P.-E. Hladik, A.-M. D\u00e9planche, N. Jussien and Y. Trinquet, Decomposition and learning for a real time task allocation problem, inProceedings CP 2004(2004) 153\u2013167.","DOI":"10.1007\/978-3-540-30201-8_14"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"H. Cambazard and N. Jussien, Integrating Benders decomposition within Constraint Programming, inProceedings CP 2005(2005) 752\u2013756. Short paper.","DOI":"10.1007\/11564751_58"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"G. Cleuziou, L. Martin and C. Vrain, Disjunctive learning with a soft-clustering method, inILP'03:13th International Conference on Inductive Logic Programming, LNCS, September (2003) 75\u201392.","DOI":"10.1007\/978-3-540-39917-9_7"},{"key":"R10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"Geoffrion","year":"1972","journal-title":"J. Optim. Theory Practice"},{"key":"R11","unstructured":"M. Ghoniem, N. Jussien and J.-D. Fekete, VISEXP: visualizing constraint solver dynamics using explanations, inProceedings FLAIRS'04, Miami, Florida, USA, May (2004) 263\u2013268."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"C.P. Gomes, B.t Selman and N. Crato, Heavy-tailed distributions in combinatorial search, inProceeding CP 97, Linz, Austria (1997) 121\u2013135.","DOI":"10.1007\/BFb0017434"},{"key":"R13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"Haralick","year":"1980","journal-title":"Artificial intelligence"},{"key":"R14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"Hooker","year":"2003","journal-title":"Math. Program."},{"key":"R15","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"Jain","year":"2001","journal-title":"Informs J. Comput."},{"key":"R16","unstructured":"N. Jussien,The versatility of using explanations within constraint programming. Habilitation thesis, Universit\u00e9 de Nantes, France, also available as RR-03-04 research report at \u00c9cole des Mines de Nantes (2003)."},{"key":"R17","unstructured":"N. Jussien and V. Barichard, The PaLM system: explanation-based constraint programming, inProceedings of TRICS: Techniques foR Implementing Constraint programming Systems, a post-conference workshop of CP 2000, Singapore (2000) 118\u2013133."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"N. Jussien, R. Debruyne and P. Boizumault, Maintaining arc-consistency within dynamic backtracking, inProceedings CP 2000, edited by R. Dechter, Singapore (2000) 249\u2013261.","DOI":"10.1007\/3-540-45349-0_19"},{"key":"R19","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0004-3702(02)00221-7","volume":"139","author":"Jussien","year":"2002","journal-title":"Artificial Intelligence"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman and L. Troyanski, Determining computational complexity for characteristic `phase transitions', inNature400(1999) 133\u2013137.","DOI":"10.1038\/22055"},{"key":"R21","unstructured":"P. Prosser,MAC-CBJ: maintaining arc-consistency with conflict-directed backjumping.Research report 95\/177, Department of Computer Science \u2013 University of Strathclyde (2005)."},{"key":"R22","doi-asserted-by":"crossref","unstructured":"P. Prosser, K. Stergiou and T. Walsh, Singleton consistencies, inProceedings CP 2000, edited by R. Dechter, Singapore (2000) 353\u2013368.","DOI":"10.1007\/3-540-45349-0_26"},{"key":"R23","doi-asserted-by":"crossref","unstructured":"P. Refalo, Impact-based search strategies for constraint programming, inProceedings CP 2004, Toronto, Canada (2004) 556\u2013571.","DOI":"10.1007\/978-3-540-30201-8_41"},{"key":"R24","unstructured":"J.-C. R\u00e9gin, A filtering algorithm for constraints of difference in CSPs, inAAAI 94, Twelth National Conference on Artificial Intelligence, Seattle, Washington (1994) 362\u2013367."},{"key":"R25","unstructured":"R. Williams, C. Gomes and B. Selman, On the connections between backdoors and heavy-tails on combinatorial search, inthe International Conference on Theory and Applications of Satisfiability Testing (SAT)(2003)."},{"key":"R26","unstructured":"Ryan Williams, Carla P. Gomes, and Bart Selman. Backdoors to typical case complexity, inProceedings IJCAI 2003(2003)."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2007004\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T15:45:23Z","timestamp":1556120723000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2007004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":26,"journal-issue":{"issue":"4"},"alternative-id":["ro0653"],"URL":"https:\/\/doi.org\/10.1051\/ro:2007004","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10]]}}}