{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:46:08Z","timestamp":1743083168155,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859574"},{"type":"electronic","value":"9783540859581"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85958-1_51","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:26:13Z","timestamp":1221881173000},"page":"608-612","source":"Crossref","is-referenced-by-count":3,"title":["On the Efficiency of Impact Based Heuristics"],"prefix":"10.1007","author":[{"given":"Marco","family":"Correia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Barahona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","unstructured":"Bessi\u00e9re, C., R\u00e9gin, J.-C.: Arc consistency for general constraint networks: preliminary results. In: Procs. of IJCAI 1997, Nagoya, Japan, pp. 398\u2013404 (1997)"},{"key":"51_CR2","first-page":"146","volume-title":"ECAI","author":"F. Boussemart","year":"2004","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI, Spain, pp. 146\u2013150. IOS Press, Amsterdam (2004)"},{"key":"51_CR3","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceeding of IJCAI 1991, pp. 331\u2013340 (1991)"},{"key":"51_CR4","unstructured":"Correia, M., Barahona, P.: On the integration of singleton consistency and looh-ahead heuristics. In: Procs. of the annual ERCIM workshop on constraint solving and constraint logic programming, Rocquencourt, France (June 2007)"},{"key":"51_CR5","unstructured":"Culberson, J.: Graph coloring resources, \n                      http:\/\/web.cs.ualberta.ca\/~joe\/Coloring\/Generators\/generate.html"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Dotu, del Val, Cebrian: Redundant modeling for the quasigroup completion problem. In: ICCP: Int. Conf. on Constraint Programming (CP). LNCS (2003)","DOI":"10.1007\/978-3-540-45193-8_20"},{"key":"51_CR7","first-page":"31","volume-title":"Procs. of ECAI 1992","author":"P.A. Geelen","year":"1992","unstructured":"Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: Procs. of ECAI 1992, New York, NY, USA, pp. 31\u201335. John Wiley & Sons, Inc., Chichester (1992)"},{"key":"51_CR8","unstructured":"Gent, I.P., MacIntyre, E., Prosser, P., Walsh, T.: The constrainedness of search. In: Proceedings of AAAI 1996, vol.\u00a01, pp. 246\u2013252 (1996)"},{"issue":"4","key":"51_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1011454308633","volume":"6","author":"I.P. Gent","year":"2001","unstructured":"Gent, I.P., MacIntyre, E., Prosser, P., Smith, B.M., Walsh, T.: Random constraint satisfaction: Flaws and structure. Constraints\u00a06(4), 345\u2013372 (2001)","journal-title":"Constraints"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Kautz, Ruan, Achlioptas, Gomes, Selman, Stickel: Balance and filtering in structured satisfiable problems. In: Procs. of IJCAI 2001 (2001)","DOI":"10.1016\/S1571-0653(04)00310-5"},{"key":"51_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":"51_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85958-1_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:07:25Z","timestamp":1715238445000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85958-1_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859574","9783540859581"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85958-1_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}