{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T10:29:02Z","timestamp":1777544942382,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540232377","type":"print"},{"value":"9783540286455","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-28645-5_10","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T22:13:58Z","timestamp":1285020838000},"page":"93-102","source":"Crossref","is-referenced-by-count":8,"title":["A Cooperative Framework Based on Local Search and Constraint Programming for Solving Discrete Global Optimisation"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Castro","sequence":"first","affiliation":[]},{"given":"Michael","family":"Moossen","sequence":"additional","affiliation":[]},{"given":"Mar\u00eda Cristina","family":"Riff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","volume":"10","author":"A. Bockmayr","year":"1998","unstructured":"Bockmayr, A., Kasper, T.: Branch-and-Infer: A unifying framework for integer and finite domain constraint programming. INFORMS J. Computing\u00a010(3), 287\u2013300 (1998); Also available as Technical Report MPI-I-97-2-008 of the Max Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","journal-title":"INFORMS J. Computing"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-46562-6_36","volume-title":"Perspectives of System Informatics","author":"C. Castro","year":"2000","unstructured":"Castro, C., Monfroy, E.: A Control Language for Designing Constraint Solvers. In: Bjorner, D., Broy, M., Zamulin, A.V. (eds.) PSI 1999. LNCS, vol.\u00a01755, pp. 402\u2013415. Springer, Heidelberg (2000)"},{"key":"10_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/3-540-44990-6_11","volume-title":"Artificial Intelligence and Symbolic Computation","author":"C. Castro","year":"2001","unstructured":"Castro, C., Monfroy, E.: Basic Operators for Solving Constraints via Collaboration of Solvers. In: Campbell, J., Roanes-Lozano, E. (eds.) AISC 2000. LNCS (LNAI), vol.\u00a01930, pp. 142\u2013156. Springer, Heidelberg (2001)"},{"key":"10_CR4","unstructured":"Castro, C., Monfroy, E.: Towards a framework for designing constraint solvers and solver collaborations. Joint Bulletin of the Novosibirsk Computing Center (NCC) and the A. P. Ershov Institute of Informatics Systems (IIS). Series: Computer Science. Russian Academy of Sciences, Siberian Branch 16, 1\u201328 (December 2001)"},{"key":"10_CR5","volume-title":"Local Search and Constraint Programming","author":"F. Focacci","year":"2003","unstructured":"Focacci, F., Laburthe, F., Lodi, A.: Constraint and Integer Programming: Toward a Unified Methodology. In: Local Search and Constraint Programming, November 2003, ch.\u00a09, Kluwer, Dordrecht (2003)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1145\/384101.384123","volume-title":"Proceedings of the 26th International Symposium on Symbolic and Algebraic Computation (ISSAC 2001)","author":"L. Granvilliers","year":"2001","unstructured":"Granvilliers, L., Monfroy, E., Benhamou, F.: Symbolic-Interval Cooperation in Constraint Programming. In: Proceedings of the 26th International Symposium on Symbolic and Algebraic Computation (ISSAC 2001), University of Western Ontario, London, Ontario, Canada, pp. 150\u2013166. ACM Press, New York (2001)"},{"key":"10_CR7","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., Elliot, G.L.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence\u00a014, 263\u2013313 (1980)","journal-title":"Artificial Intelligence"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0004-3702(02)00221-7","volume":"139","author":"Jussien","year":"2002","unstructured":"Jussien, Lhomme: Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence\u00a0139, 21\u201345 (2002)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10_CR9","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"Kumar, V.: Algorithms for Constraint-Satisfaction Problems: A Survey. Artificial Intelligence Magazine\u00a013(1), 32\u201344 (1992)","journal-title":"Artificial Intelligence Magazine"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in Networks of Relations. Artificial Intelligence\u00a08, 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"10_CR11","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1142\/S0218213095000061","volume":"4","author":"P. Marti","year":"1995","unstructured":"Marti, P., Rueher, M.: A Distributed Cooperating Constraints Solving System. International Journal of Artificial Intelligence Tools\u00a04(1-2), 93\u2013113 (1995)","journal-title":"International Journal of Artificial Intelligence Tools"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/331119.331147","volume-title":"Proceedings of ACM Symposium on Applied Computing (SAC 1996)","author":"E. Monfroy","year":"1996","unstructured":"Monfroy, E., Rusinowitch, M., Schott, R.: Implementing Non-Linear Constraints with Cooperative Solvers. In: George, K.M., Carroll, J.H., Oppenheim, D., Hightower, J. (eds.) Proceedings of ACM Symposium on Applied Computing (SAC 1996), Philadelphia, PA, USA, February 1996, pp. 63\u201372. ACM Press, New York (1996)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1021140902684","volume":"115","author":"Prestwich","year":"2002","unstructured":"Prestwich: Combining the scalability of local search with the pruning techniques of systematic search. Annals of Operations Research\u00a0115, 51\u201372 (2002)","journal-title":"Annals of Operations Research"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Solomon, M.: Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research, 254\u2013365 (1987)","DOI":"10.1287\/opre.35.2.254"},{"key":"10_CR15","volume-title":"Foundations of Constraint Satisfaction","author":"E. Tsang","year":"1993","unstructured":"Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/09528139650042547","volume":"8","author":"M. Zahn","year":"1996","unstructured":"Zahn, M., Hower, W.: Backtracking along with constraint processing and their time complexities. Journal of Experimental and Theoretical Artificial Intelligence\u00a08, 63\u201374 (1996)","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence \u2013 SBIA 2004"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28645-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T23:53:24Z","timestamp":1675900404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-28645-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232377","9783540286455"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28645-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}