Principles and Practice of Constraint Programming – CP 2003
From MaRDI portal
Publication:5897229
DOI10.1007/b13743zbMath1273.68341MaRDI QIDQ5897229
Publication date: 2 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13743
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Hybrid tractability of valued constraint problems, A hybrid tractable class for non-binary CSPs, Binary constraint satisfaction problems defined by excluded topological minors, The power of propagation: when GAC is enough, A new branch-and-filter exact algorithm for binary constraint satisfaction problems, Domain permutation reduction for constraint satisfaction problems