{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:53:36Z","timestamp":1743134016720,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385155"},{"type":"electronic","value":"9783642385162"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-38516-2_5","type":"book-chapter","created":{"date-parts":[[2013,5,16]],"date-time":"2013-05-16T03:10:01Z","timestamp":1368673801000},"page":"52-61","source":"Crossref","is-referenced-by-count":1,"title":["Interleaving Constraint Propagation: An Efficient Cooperative Search with Branch and Bound"],"prefix":"10.1007","author":[{"given":"Eric","family":"Monfroy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K.R.: Principles of Constraint Programming. Cambridge Univ. Press (2003)","DOI":"10.1017\/CBO9780511615320"},{"issue":"11","key":"5_CR2","first-page":"1069","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: Or-library: distributing test problems by electronic mail. JORS\u00a041(11), 1069\u20131072 (1990)","journal-title":"JORS"},{"key":"5_CR3","unstructured":"Berkelaar, M.: lpsolve\u2014simplex-based code for linear and integer programming"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C. Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv.\u00a035(3), 268\u2013308 (2003)","journal-title":"ACM Comput. Surv."},{"key":"5_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/11579427_17","volume-title":"MICAI 2005: Advances in Artificial Intelligence","author":"C. Castro","year":"2005","unstructured":"Castro, C., Monfroy, E., Figueroa, C., Meneses, R.: An approach for dynamic split strategies in constraint solving. In: Gelbukh, A., de Albornoz, \u00c1., Terashima-Mar\u00edn, H. (eds.) MICAI 2005. LNCS (LNAI), vol.\u00a03789, pp. 162\u2013174. Springer, Heidelberg (2005)"},{"issue":"5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1690","DOI":"10.1016\/j.eswa.2012.09.013","volume":"40","author":"B. Crawford","year":"2013","unstructured":"Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, F.: Parameter tuning of a choice-function based hyperheuristic using particle swarm optimization. Expert Syst. Appl.\u00a040(5), 1690\u20131695 (2013)","journal-title":"Expert Syst. Appl."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11546245_4","volume-title":"Hybrid Metaheuristics","author":"M. El-Abd","year":"2005","unstructured":"El-Abd, M., Kamel, M.: A taxonomy of cooperative search algorithms. In: Blesa, M.J., Blum, C., Roli, A., Sampels, M. (eds.) HM 2005. LNCS, vol.\u00a03636, pp. 32\u201341. Springer, Heidelberg (2005)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Gent, I., Walsh, T.: Csplib: a benchmark library for constraints. Technical report, APES-09-1999 (1999), \n                    http:\/\/csplib.cs.strath.ac.uk\/","DOI":"10.1007\/978-3-540-48085-3_36"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Hamadi, Y. Monfroy, E., Saubion, F.: What is autonomous search? In: The Ten years of CP-AI-OR. Springer (2010) (to appear)","DOI":"10.1007\/978-1-4419-1644-0_11"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Hamadi, Y., Monfroy, E., Saubion, F. (eds.): Autonomous Search. Springer (2012)","DOI":"10.1007\/978-3-642-21434-9"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11890393_37","volume-title":"Advances in Information Systems","author":"E. Monfroy","year":"2006","unstructured":"Monfroy, E., Castro, C., Crawford, B.: Adaptive enumeration strategies and metabacktracks for constraint solving. In: Yakhno, T., Neuhold, E.J. (eds.) ADVIS 2006. LNCS, vol.\u00a04243, pp. 354\u2013363. Springer, Heidelberg (2006)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Monfroy, E., Castro, C., Crawford, B., Figueroa, C.: Adaptive hybridization strategies. In: ACM Symposium on Applied Computing, pp. 922\u2013923 (2011)","DOI":"10.1145\/1982185.1982387"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/0952813X.2012.656328","volume":"25","author":"E. Monfroy","year":"2013","unstructured":"Monfroy, E., Castro, C., Crawford, B., Soto, R., Paredes, F., Figueroa, C.: A reactive and hybrid constraint solver. Journal of Experimental and Theoretical Artificial Intelligence\u00a025(1), 1\u201322 (2013)","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"key":"5_CR14","unstructured":"Rice, J.: The algorithm selection problem. Technical Report CSD-TR 152, Purdue Univ. (1975)"},{"key":"5_CR15","unstructured":"Rodosek, R., Wallace, M., Hajian, M.: A new approach to integrating mixed integer programming and clp. Baltzer Journal (1998)"},{"key":"5_CR16","unstructured":"Schulte, C., Tack, G., Lagerkvist, M.: Gecode: Generic constraint development environment. In: INFORMS Annual Meeting (2006)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38516-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T02:19:47Z","timestamp":1674526787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38516-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385155","9783642385162"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38516-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}