{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:25:08Z","timestamp":1725470708712},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540409304"},{"type":"electronic","value":"9783540409311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11861461_8","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T15:45:47Z","timestamp":1158162347000},"page":"56-65","source":"Crossref","is-referenced-by-count":4,"title":["Using Local Search for Guiding Enumeration in Constraint Solving"],"prefix":"10.1007","author":[{"given":"Eric","family":"Monfroy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K.R. Apt","year":"2003","unstructured":"Apt, K.R.: Principles of Constraint Programming. Cambridge Univ. Press, Cambridge (2003)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/978-3-540-30201-8_52","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"J.C. Beck","year":"2004","unstructured":"Beck, J.C., Prosser, P., Wallace, R.J.: Variable Ordering Heuristics Show Promise. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 711\u2013715. Springer, Heidelberg (2004)"},{"key":"8_CR3","first-page":"369","volume-title":"Proc. of ICLP 1994","author":"Y. Caseau","year":"1994","unstructured":"Caseau, Y., Laburthe, F.: Improved clp scheduling with task intervals. In: Proc. of ICLP 1994, pp. 369\u2013383. MIT Press, Cambridge (1994)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-540-30106-6_46","volume-title":"Artificial Intelligence: Methodology, Systems, and Applications","author":"C. Castro","year":"2004","unstructured":"Castro, C., Monfroy, E.: Designing hybrid cooperations with a component language for solving optimisation problems. In: Bussler, C.J., Fensel, D. (eds.) AIMSA 2004. LNCS, vol.\u00a03192, pp. 447\u2013458. Springer, Heidelberg (2004)"},{"key":"8_CR5","series-title":"International Series in Operations Research and Management Science","volume-title":"Handbook of Metaheuristics","author":"F. Focacci","year":"2002","unstructured":"Focacci, F., Laburthe, F., Lodi, A.: Local search and constraint programming. In: Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol.\u00a057. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"8_CR6","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H. Hoos","year":"2004","unstructured":"Hoos, H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2004)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/11564751_26","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"T. Hulubei","year":"2005","unstructured":"Hulubei, T., O\u2019Sullivan, B.: Search heuristics and heavy-tailed behaviour. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 328\u2013342. Springer, Heidelberg (2005)"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0004-3702(02)00221-7","volume":"139","author":"N. Jussien","year":"2002","unstructured":"Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artif. Intell.\u00a0139(1), 21\u201345 (2002)","journal-title":"Artif. Intell."},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-24664-0_12","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"O. Kamarainen","year":"2004","unstructured":"Kamarainen, O., Sakkout, H.E.: Local probing applied to network routing. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 173\u2013189. Springer, Heidelberg (2004)"},{"issue":"3-4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018999721141","volume":"22","author":"B. Mazure","year":"1998","unstructured":"Mazure, B., Sais, L., Gr\u00e9goire, \u00c9.: Boosting complete techniques thanks to local search methods. Ann. Math. Artif. Intell.\u00a022(3-4), 319\u2013331 (1998)","journal-title":"Ann. Math. Artif. Intell."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/11559306_8","volume-title":"Frontiers of Combining Systems","author":"E. Monfroy","year":"2005","unstructured":"Monfroy, E., Saubion, F., Lambert, T.: Hybrid CSP solving. In: Gramlich, B. (ed.) FroCos 2005. LNCS, vol.\u00a03717, pp. 138\u2013167. Springer, Heidelberg (2005)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-45349-0_25","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"S.D. Prestwich","year":"2000","unstructured":"Prestwich, S.D.: A hybrid search architecture applied to hard random 3-SAT and low-autocorrelation binary sequences. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 337\u2013352. Springer, Heidelberg (2000)"},{"key":"#cr-split#-8_CR13.1","unstructured":"Prestwich, S.: Local search and backtracking vs non-systematic backtracking. In: Proceedings of AAAI 2001, Fall Symposium on Using Uncertainty within Computation, pp. 109\u2013115. AAAI Press, Menlo Park (2001);"},{"key":"#cr-split#-8_CR13.2","unstructured":"Technical Report FS-01-04"},{"key":"8_CR14","unstructured":"Wallace, M.: Hybrid algorithms, local search, and Eclipse. CP Summer School 2005 (2005), \n                    \n                      http:\/\/www.math.unipd.it\/~frossi\/cp-school\/wallace-lec_notes.pdf"},{"issue":"4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1014450507312","volume":"34","author":"M. Wallace","year":"2002","unstructured":"Wallace, M., Schimpf, J.: Finding the right hybrid algorithm - a combinatorial meta-problem. Ann. Math. Artif. Intell.\u00a034(4), 259\u2013269 (2002)","journal-title":"Ann. Math. Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence: Methodology, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11861461_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:20:29Z","timestamp":1619508029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11861461_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540409304","9783540409311"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11861461_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}