Filtering Algorithms for the NValue Constraint

DOI10.1007/11493853_8zbMath1133.68427OpenAlexW1593490483MaRDI QIDQ5450923

Christian Bessiere, Emmanuel Hebrard, Toby Walsh, Zeynep Kiziltan, Brahim Hnich

Publication date: 17 March 2008

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00135540/file/constraints06-nvalue.pdf

Mathematics Subject Classification ID

Combinatorial optimization (90C27) 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 (7)

Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints ⋮ Combining Two Structured Domains for Modeling Various Graph Matching Problems ⋮ Global constraint catalogue: past, present and future ⋮ Bounds of graph parameters for global constraints ⋮ The complexity of reasoning with global constraints ⋮ Weighted matching as a generic pruning technique applied to optimization constraints ⋮ Parameterized Complexity Results in Symmetry Breaking

This page was built for publication: Filtering Algorithms for the NValue Constraint