Complete bound consistency for the global cardinality constraint

DOI10.1007/S10601-005-2237-YzbMath1084.68138OpenAlexW1976524267MaRDI QIDQ816681

Sven Thiel, Irit Katriel

Publication date: 23 February 2006

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-005-2237-y

zbMATH Keywords

matchingflowconstraint propagationgraph algorithmsglobal constraintsglobal cardinality constraintfiltering algorithmsarc consistencybound consistency

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Cardinality constraints and systems of restricted representatives ⋮ Filtering algorithms for the multiset ordering constraint ⋮ A MinCumulative resource constraint ⋮ Global constraint catalogue: past, present and future ⋮ The extended global cardinality constraint: an empirical survey ⋮ Core group placement: allocation and provisioning of heterogeneous resources ⋮ Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction

Cites Work

• A linear-time algorithm for a special case of disjoint set union
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complete bound consistency for the global cardinality constraint