{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:17:09Z","timestamp":1725603429796},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_21","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T03:58:42Z","timestamp":1314763122000},"page":"256-270","source":"Crossref","is-referenced-by-count":5,"title":["Synthesis of Search Algorithms from High-Level CP Models"],"prefix":"10.1007","author":[{"given":"Samir A. Mohamed","family":"Elsayed","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Michel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., Ergun, \u00d6., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Appl. Math.\u00a0123(1-3), 75\u2013102 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"21_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Mathematical and Computer Modelling\u00a020(12), 97\u2013123 (1994)","journal-title":"Mathematical and Computer Modelling"},{"key":"21_CR3","first-page":"146","volume-title":"Proceedings of the Sixteenth Eureopean Conference on Artificial Intelligence, ECAI 2004","author":"F. Boussemart","year":"2004","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting Systematic Search by Weighting Constraints. In: Proceedings of the Sixteenth Eureopean Conference on Artificial Intelligence, ECAI 2004, pp. 146\u2013150. IOS Press, Amsterdam (2004)"},{"key":"21_CR4","unstructured":"Elsayed, S.A.M., Michel, L.: Synthesis of search algorithms from high-level CP models. In: Cohen, D. (ed.) CP 2010. LNCS, vol.\u00a06308, pp. 186\u2013200. Springer, Heidelberg (2010)"},{"key":"21_CR5","unstructured":"Eriksson, M.: Detecting symmetries in relational models of CSPs. Master\u2019s thesis, Department of Information Technology,Uppsala University, Sweden (2005)"},{"key":"21_CR6","unstructured":"Gent, I.P., Jefferson, C., Miguel, I.: Minion: A fast, scalable, constraint solver. In: ECAI 2006: 17th European Conference on Artificial Intelligence, August 29-September 1, Riva del Garda, Italy, p. 98 (2006)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/978-3-540-48085-3_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"I.P. Gent","year":"1999","unstructured":"Gent, I.P., Walsh, T.: CSPLib: a benchmark library for constraints. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 480\u2013481. Springer, Heidelberg (1999)"},{"issue":"5","key":"21_CR8","doi-asserted-by":"publisher","first-page":"667","DOI":"10.2307\/2089624","volume":"27","author":"J.P. Gibbs","year":"1962","unstructured":"Gibbs, J.P., Martin, W.T.: Urbanization, technology, and the division of labor: International patterns. American Sociological Review\u00a027(5), 667\u2013677 (1962)","journal-title":"American Sociological Review"},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"C.P. Gomes","year":"2000","unstructured":"Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of automated reasoning\u00a024(1), 67\u2013100 (2000)","journal-title":"Journal of automated reasoning"},{"key":"21_CR10","unstructured":"Belgian Constraints Group. Data and results for the steel mill slab problem, http:\/\/becool.info.ucl.ac.be\/steelmillslab , Technical report, UCLouvain"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence\u00a014(3), 263\u2013313 (1980)","journal-title":"Artificial Intelligence"},{"key":"21_CR12","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: International Joint Conference on Artificial Intelligence, vol.\u00a014, pp. 607\u2013615 (1995)"},{"key":"21_CR13","unstructured":"Van Hentenryck, P., Flener, P., Pearson, J., \u00c5gren, M.: Tractable Symmetry Breaking for CSPs with Interchangeable Values. In: IJCAI, pp. 277\u2013284 (2003)"},{"key":"21_CR14","unstructured":"SA ILOG. ILOG Concert 2.0"},{"key":"21_CR15","unstructured":"Michel, L., Van Hentenryck, P.: Impact-based versus Activity-based Search for Black-Box Contraint-Programming Solvers (2011), http:\/\/arxiv.org\/abs\/1105.6314"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Monette, J.N., Deville, Y., Van Hentenryck, P.: Aeon: Synthesizing scheduling algorithms from high-level models. Operations Research and Cyber-Infrastructure, 43\u201359 (2009)","DOI":"10.1007\/978-0-387-88843-9_3"},{"key":"21_CR17","unstructured":"OMahony, E., Hebrard, E., Holland, A., Nugent, C., OSullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: 19th Irish Conference on AI (2008)"},{"key":"21_CR18","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.\u00a03258, pp. 557\u2013571. Springer, Heidelberg (2004)"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-01929-6_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P. Schaus","year":"2009","unstructured":"Schaus, P., Hentenryck, P., R\u00e9gin, J.-C.: Scalable load balancing in nurse to patient assignment problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 248\u2013262. Springer, Heidelberg (2009)"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","first-page":"321","volume-title":"Parallel Computing Technologies","author":"B.M. Smith","year":"1997","unstructured":"Smith, B.M.: Succeed-first or fail-first: A case study in variable and value ordering. In: Malyshkin, V.E. (ed.) PaCT 1997. LNCS, vol.\u00a01277, pp. 321\u2013330. Springer, Heidelberg (1997)"},{"key":"21_CR21","unstructured":"Gecode Team. Gecode: Generic constraint development environment (2006), http:\/\/www.gecode.org"},{"issue":"4","key":"21_CR22","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/ijoc.14.4.345.2826","volume":"14","author":"P. Hentenryck Van","year":"2002","unstructured":"Van Hentenryck, P.: Constraint and integer programming in OPL. INFORMS Journal on Computing\u00a014(4), 345\u2013372 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P., Flener, P., Pearson, J., \u00c5gren, M.: Compositional derivation of symmetries for constraint satisfaction. Abstraction, Reformulation and Approximation, 234\u2013247 (2005)","DOI":"10.1007\/11527862_17"},{"key":"21_CR24","volume-title":"Constraint-based local search","author":"P. Hentenryck Van","year":"2005","unstructured":"Van Hentenryck, P., Michel, L.: Constraint-based local search. The MIT Press, Cambridge (2005)"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-68155-7_41","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P. Hentenryck Van","year":"2008","unstructured":"Van Hentenryck, P., Michel, L.: The steel mill slab design problem revisited. In: Trick, M.A. (ed.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 377\u2013381. Springer, Heidelberg (2008)"},{"key":"21_CR26","first-page":"273","volume-title":"AAAI 2007","author":"P. Hentenryck Van","year":"2007","unstructured":"Van Hentenryck, P., Michel, L.: Synthesis of constraint-based local search algorithms from high-level models. In: AAAI 2007, pp. 273\u2013278. AAAI Press, Menlo Park (2007)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:37:06Z","timestamp":1560515826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}