An efficient bounds consistency algorithm for the global cardinality constraint

DOI10.1007/s10601-005-0552-yzbMath1084.68122OpenAlexW2005924051MaRDI QIDQ816677

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

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-0552-y

zbMATH Keywords

global constraintsbounds consistencydomain consistency

Mathematics Subject Classification ID

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

Related Items (3)

Cardinality constraints and systems of restricted representatives ⋮ Computing leximin-optimal solutions in constraint networks ⋮ A MinCumulative resource constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Constraint satisfaction using constraint logic programming
• On Representatives of Subsets
• Depth-First Search and Linear Graph Algorithms
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: An efficient bounds consistency algorithm for the global cardinality constraint