Principles and Practice of Constraint Programming – CP 2004
From MaRDI portal
Publication:5900328
DOI10.1007/b100482zbMath1152.68542MaRDI QIDQ5900328
Brahim Hnich, Emmanuel Hebrard, Christian Bessiere, Toby Walsh
Publication date: 9 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100482
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Weighted matching as a generic pruning technique applied to optimization constraints, Complete bound consistency for the global cardinality constraint, Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints, Symmetry breaking constraints for value symmetries in constraint satisfaction, Symmetry definitions for constraint satisfaction problems, Filtering algorithms for the NValue constraint, Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming, Tractable cases of the extended global cardinality constraint, Parameterized Complexity Results in Symmetry Breaking