{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:49:30Z","timestamp":1725572970860},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255604"},{"type":"electronic","value":"9783540321248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11415763_11","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T19:42:42Z","timestamp":1292874162000},"page":"166-184","source":"Crossref","is-referenced-by-count":0,"title":["A Local Search System for Solving Constraint Problems of Declarative Graph-Based Global Constraints"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bohlin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Alpern, B., Hoover, R., Rosen, B.K., Sweeney, P.F., Zadeck, F.K.: Incremental evaluation of computational circuits. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, January 1990, pp. 32\u201342 (1990)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-45349-0_6","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"N. Beldiceanu","year":"2000","unstructured":"Beldiceanu, N.: Global constraints as graph properties on a structured network of elementary constraints of the same type. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 52\u201366. Springer, Heidelberg (2000)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N.: Global constraints as graph properties on structured networks of elementary constraints of the same type. Technical Report 2000\/01-SE, SICS (2000)","DOI":"10.1007\/3-540-45349-0_6"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-24664-0_6","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"N. Beldiceanu","year":"2004","unstructured":"Beldiceanu, N., Petit, T.: Cost evaluation of soft global constraints. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 80\u201395. Springer, Heidelberg (2004)"},{"key":"11_CR5","unstructured":"Bohlin, M.: Design and Implementation of a Graph-Based Constraint Model for Local Search. Philosophy Licentiate Thesis No. 27, M\u00e4lardalen University (April 2004)"},{"key":"11_CR6","unstructured":"Bohlin, M., Kocjan, W., Kreuger, P.: Designing global scheduling constraints for local search: A generic approach. Technical Report T2002-20, SICS (2002)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45322-9_5","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"P. Codognet","year":"2001","unstructured":"Codognet, P., Diaz, D.: Yet another local search method for constraint solving. In: Steinh\u00f6fel, K. (ed.) SAGA 2001. LNCS, vol.\u00a02264, pp. 73\u201390. Springer, Heidelberg (2001)"},{"key":"11_CR8","first-page":"418","volume-title":"Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"P. Galinier","year":"1998","unstructured":"Galinier, P., Hao, J.-K.: Solving the progressive party problem by local search. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, ch.\u00a029, pp. 418\u2013432. Kluwer, Dordrecht (1998)"},{"key":"11_CR9","unstructured":"Galinier, P., Hao, J.-K.: A general approach for constraint solving by local search. In: Proc. CP-AI-OR 2000, Paderborn, Germany (March 2000)"},{"key":"11_CR10","first-page":"70","volume-title":"Modern Heuristic Techniques for Combinatorial Optimization","author":"F. Glover","year":"1995","unstructured":"Glover, F., Laguna, M.: Tabu search. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Optimization, ch.\u00a03, pp. 70\u2013150. McGraw-Hill, New York (1995)"},{"key":"11_CR11","unstructured":"Michel, L.: Personal communication (September 2003)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Michel, L., Hentenryck, P.V.: Localizer: A modeling language for local search. In: Principles and Practice of Constraint Programming, pp. 237\u2013251 (1997)","DOI":"10.1007\/BFb0017443"},{"key":"11_CR13","unstructured":"Michel, L., Hentenryck, P.V.: Localizer++: An open library for local search. Technical Report CS-01-02, Brown University (January 2001)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Michel, L., Hentenryck, P.V.: A constraint-based architecture for local search. In: 17th ACM OOPSLA Conference (November 2002)","DOI":"10.1145\/582419.582430"},{"issue":"1\u20133","key":"11_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence\u00a058(1\u20133), 161\u2013205 (1992)","journal-title":"Artificial Intelligence"},{"key":"11_CR16","unstructured":"Nareyek, A.: Using global constraints for local search. In: Proc. DIMACS Workshop on Constraint Programming and Large Scale Discrete Optimization, pp. 1\u201318 (1998)"},{"issue":"3","key":"11_CR17","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1145\/357172.357177","volume":"4","author":"R. Paige","year":"1982","unstructured":"Paige, R., Koenig, S.: Finite differencing of computable expressions. ACM Transactions on Programming Languages and Systems\u00a04(3), 402\u2013454 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-45578-7_31","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"T. Petit","year":"2001","unstructured":"Petit, T., Regin, J.-C., Bessiere, C.: Specific filtering algorithms for over-constrained problems. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 451\u2013463. Springer, Heidelberg (2001)"},{"key":"11_CR19","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proc. 12th National Conference on AI, Seattle, Washington, pp. 362\u2013367 (1994)"},{"key":"11_CR20","unstructured":"R\u00e9gin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proc. 13th National Conference on AI, Portland, August 1996, vol.\u00a01, pp. 209\u2013215 (1996)"},{"issue":"5","key":"11_CR21","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1109\/69.317698","volume":"6","author":"R. Sosic","year":"1994","unstructured":"Sosic, R., Gu, J.: Efficient local search with conflict minimization: A case study of the n-queens problem. IEEE Trans. Knowledge and Data Eng.\u00a06(5), 661\u2013668 (1994)","journal-title":"IEEE Trans. Knowledge and Data Eng."},{"key":"11_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48369-1","volume-title":"Integer Optimization by Local Search","author":"J.P. Walser","year":"1999","unstructured":"Walser, J.P.: Integer Optimization by Local Search. LNCS (LNAI), vol.\u00a01637. Springer, Heidelberg (1999)"},{"issue":"7","key":"11_CR23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/960116.54002","volume":"23","author":"D. Yellin","year":"1988","unstructured":"Yellin, D., Strom, R.: INC: a language for incremental computations. SIGPLAN Not.\u00a023(7), 115\u2013124 (1988)","journal-title":"SIGPLAN Not."}],"container-title":["Lecture Notes in Computer Science","Applications of Declarative Programming and Knowledge Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11415763_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:51:39Z","timestamp":1605642699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11415763_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255604","9783540321248"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11415763_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}