An efficient bounds consistency algorithm for the global cardinality constraint

DOI10.1007/S10601-005-0552-YMaRDI QIDQ816677zbMATH OpenOpenAlexFDO

Authors Claude-Guy Quimper, Alexander Golynski, Alejandro Lopez-Ortiz, P. 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)

Recommendations

• An efficient bounds consistency algorithm for the global cardinality constraint
• Principles and Practice of Constraint Programming – CP 2004
• Fast bound consistency for the global cardinality constraint
• Complete bound consistency for the global cardinality constraint
• The extended global cardinality constraint: an empirical survey

Cites work

• scientific article; zbMATH DE number 2084744 (Why is no real title available?)
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Constraint satisfaction using constraint logic programming
• Depth-First Search and Linear Graph Algorithms
• Fast bound consistency for the global cardinality constraint
• Network flows. Theory, algorithms, and applications.
• On Representatives of Subsets
• Principles and Practice of Constraint Programming – CP 2004

Cited in

(12)

• An efficient bounds consistency algorithm for the global cardinality constraint
• Incremental Encoding and Solving of Cardinality Constraints
• The extended global cardinality constraint: an empirical survey
• scientific article; zbMATH DE number 2080035 (Why is no real title available?)
• Fast bound consistency for the global cardinality constraint
• Principles and Practice of Constraint Programming – CP 2004
• The complexity of global cardinality constraints
• Cardinality constraints and systems of restricted representatives
• Complete bound consistency for the global cardinality constraint
• Tight LP-Relaxations of Overlapping Global Cardinality Constraints
• Computing leximin-optimal solutions in constraint networks
• A MinCumulative resource constraint

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816677)