Principles and Practice of Constraint Programming – CP 2004

DOI10.1007/b100482zbMath1152.68576OpenAlexW1508891358MaRDI QIDQ5900317

Claude-Guy Quimper, Alexander Golynski, Alejandro López-Ortiz, Peter J. L. van Beek

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Structural decompositions for problems with global constraints ⋮ Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints ⋮ Generalizing Global Constraints Based on Network Flows ⋮ Multiconsistency and robustness with global constraints ⋮ Global constraint catalogue: past, present and future ⋮ Models for global constraint applications ⋮ Tractable cases of the extended global cardinality constraint ⋮ Breaking Symmetry of Interchangeable Variables and Values ⋮ Bounds of graph parameters for global constraints ⋮ Guarantees and limits of preprocessing in constraint satisfaction and reasoning ⋮ A CSP search algorithm with responsibility sets and kernels ⋮ Dulmage-Mendelsohn canonical decomposition as a generic pruning technique ⋮ Enhancing set constraint solvers with lexicographic bounds ⋮ The extended global cardinality constraint: an empirical survey ⋮ Bucket elimination for multiobjective optimization problems ⋮ Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction ⋮ An efficient bounds consistency algorithm for the global cardinality constraint ⋮ Complete bound consistency for the global cardinality constraint