{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:41:59Z","timestamp":1725514919224},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723967"},{"type":"electronic","value":"9783540723974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_15","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T15:56:32Z","timestamp":1182527792000},"page":"200-213","source":"Crossref","is-referenced-by-count":1,"title":["Directional Interchangeability for Enhancing CSP Solving"],"prefix":"10.1007","author":[{"given":"Wady","family":"Naanaa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Frost, D., Bessi\u00e8re, C., Dechter, R., R\u00e9gin, J.C.: Random uniform CSP generators, \n                  \n                    http:\/\/www.lirmm.fr\/~bessiere\/generator.html","key":"15_CR1"},{"unstructured":"Bowen, J., Likitvivatanavong, C.: Domain transmutation in constraint satisfaction problems. In: Proceedings of AAAI-04 (2004)","key":"15_CR2"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1009812409930","volume":"4","author":"B. Cabon","year":"1999","unstructured":"Cabon, B., De Givry, S., Lobjois, L., Schiex, T., Warners, J.P.: Radio link frequency assignement. Constraints\u00a04(1), 79\u201389 (1999)","journal-title":"Constraints"},{"unstructured":"http:\/\/www.cril.univ-artois.fr\/~lecoutre\/research\/benchmarks\/benchmarks.html","key":"15_CR4"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","volume":"34","author":"R. Dechter","year":"1988","unstructured":"Dechter, R., Pearl, J.: Network-based heuristics for constraint satisfaction problems. Artificial Intelligence\u00a034, 1\u201338 (1988)","journal-title":"Artificial Intelligence"},{"unstructured":"Freuder, E.C.: Eliminating interchangeable values in constraint satisfaction problems. In: Proceedings of AAAI-91, pp. 227\u2013233 (1991)","key":"15_CR6"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. Haralick","year":"1980","unstructured":"Haralick, R., Elliot, G.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence\u00a014, 263\u2013313 (1980)","journal-title":"Artificial Intelligence"},{"unstructured":"Harvey, W., Ginsberg, M.: Limited discrepancy search. In: Proceedings of the 14\n                  th\n                 International Joint Conference On Artificial Intelligence, pp. 607\u2013613 (1995)","key":"15_CR8"},{"unstructured":"Haselb\u00f6ck, A.: Exploiting interchangeability in constraint satisfaction problems. In: Proceedings of IJCAI-93, pp. 282\u2013297 (1993)","key":"15_CR9"},{"unstructured":"Ginsberg, M.L., Parkes, A.J., Roy, A.: Super-model and robustness. In: Proceeding of AAAI-98, Madison, Wisconsin (1998)","key":"15_CR10"},{"unstructured":"Lal, A., Choueiry, B.Y., Freuder, E.C.: Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs. In: Proceedings of AAAI-05, pp. 397\u2013404 (2005)","key":"15_CR11"},{"doi-asserted-by":"crossref","unstructured":"Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satisfaction. In: Proceedings of the 11th European Conference on Artificial Intelligence (1994)","key":"15_CR12","DOI":"10.1007\/3-540-58601-6_86"},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0004-3702(99)00077-6","volume":"115","author":"R. Weigel","year":"1999","unstructured":"Weigel, R., Faltings, B.V.: Compiling constraint satisfaction problems. Artificial Intelligence\u00a0115(2), 257\u2013287 (1999)","journal-title":"Artificial Intelligence"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"15_CR15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1613\/jair.696","volume":"12","author":"K. Xu","year":"2000","unstructured":"Xu, K., Li, W.: Exact phase transitions in random constraint satisfaction problems. Journal of Artificial Intelligence Research\u00a012, 93\u2013103 (2000)","journal-title":"Journal of Artificial Intelligence Research"},{"unstructured":"Zhang, Y., Freuder, E.C.: Conditional interchangeability and substitutability. In: Proceedings of Fourth International Workshop on Symmetry and Constraint Satisfaction Problems (SymCon04), Toronto (2004)","key":"15_CR16"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72397-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T06:35:10Z","timestamp":1550385310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}