{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:24:47Z","timestamp":1761895487673},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_15","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T03:59:40Z","timestamp":1336967980000},"page":"228-243","source":"Crossref","is-referenced-by-count":49,"title":["Activity-Based Search for Black-Box Constraint Programming Solvers"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Michel","sequence":"first","affiliation":[]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: de M\u00e1ntaras, R.L., Saitta, L. (eds.) ECAI, pp. 146\u2013150. IOS Press (2004)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BFb0095116","volume-title":"Foundations of Intelligent Systems","author":"L. Brisoux","year":"1999","unstructured":"Brisoux, L., Gr\u00e9goire, \u00c9., Sais, L.: Improving Backtrack Search for SAT by Means of Redundancy. In: Ra\u015b, Z.W., Skowron, A. (eds.) ISMIS 1999. LNCS, vol.\u00a01609, pp. 301\u2013309. Springer, Heidelberg (1999)"},{"key":"15_CR3","unstructured":"Dechter, R., Pearl, J.: The cycle-cutset method for improving search performance in ai applications. In: Proceedings of 3rd IEEE Conference on AI Applications, Orlando, FL (1987)"},{"key":"15_CR4","unstructured":"Dynadec, I.: Comet v2.1 user manual. Technical report, Providence, RI (2009)"},{"key":"15_CR5","unstructured":"G12 (2008), \n                  \n                    http:\/\/www.g12.cs.mu.oz.au\/minizinc\/"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-642-23786-7_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"S. Kadioglu","year":"2011","unstructured":"Kadioglu, S., O\u2019Mahony, E., Refalo, P., Sellmann, M.: Incorporating Variance in Impact-Based Search. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 470\u2013477. Springer, Heidelberg (2011)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1145\/378239.379017","volume-title":"Proceedings of the 38th Annual Design Automation Conference, DAC 2001","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient sat solver. In: Proceedings of the 38th Annual Design Automation Conference, DAC 2001, pp. 530\u2013535. ACM, New York (2001)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N. Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: Towards a Standard CP Modelling Language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 529\u2013543. Springer, Heidelberg (2007)"},{"key":"15_CR9","unstructured":"Perron, L.: (2010), \n                  \n                    http:\/\/code.google.com\/p\/or-tools\/"},{"key":"15_CR10","first-page":"9","volume":"81","author":"G. Pesant","year":"2009","unstructured":"Pesant, G.: Counting and estimating lattice points: Special polytopes for branching heuristics in constraint programming. Optima Newsletter\u00a081, 9\u201314 (2009)","journal-title":"Optima Newsletter"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/3-540-45349-0_26","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"P. Prosser","year":"2000","unstructured":"Prosser, P., Stergiou, K., Walsh, T.: Singleton Consistencies. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 353\u2013368. Springer, Heidelberg (2000)"},{"key":"15_CR12","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":"15_CR13","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., Van 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":"15_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF00143880","volume":"1","author":"B. Smith","year":"1996","unstructured":"Smith, B., Brailsford, S., Hubbard, P., Williams, H.: The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared. Constraints\u00a01, 119\u2013138 (1996)","journal-title":"Constraints"},{"key":"15_CR15","unstructured":"Trick, M.A.: A dynamic programming approach for consistency and propagation for knapsack constraints. In: Annals of Operations Research, pp. 113\u2013124 (2001)"},{"key":"15_CR16","first-page":"1173","volume-title":"Proceedings of the 18th International Joint Conference on Artificial Intelligence","author":"R. Williams","year":"2003","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp. 1173\u20131178. Morgan Kaufmann Publishers Inc., San Francisco (2003)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T05:21:21Z","timestamp":1556774481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}