Cost-based arc consistency for global cardinality constraints

DOI10.1023/A:1020506526052zbMath1028.68157OpenAlexW1565441993MaRDI QIDQ1871974

Jean-Charles Régin

Publication date: 4 May 2003

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020506526052

zbMATH Keywords

cardinality constraintsconstraint satisfaction problemglobal constraintfiltering algorithmarc consistencycardinality constraints with costs

Mathematics Subject Classification ID

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

Related Items

Cardinality constraints and systems of restricted representatives, Constraint programming and operations research, A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property, A \texttt{cost-regular} based hybrid column generation approach, Automatically improving constraint models in Savile Row, A polyhedral approach to the \textit{alldifferent} system, Efficient filtering for the resource-cost alldifferent constraint, Solving finite-domain linear constraints in presence of the $\texttt{alldifferent}$, Hybrid tractability of valued constraint problems, Cost Propagation – Numerical Propagation for Optimization Problems, Nutmeg: a MIP and CP hybrid solver using branch-and-check, The complexity of reasoning with global constraints, Weighted matching as a generic pruning technique applied to optimization constraints, Bounding, filtering and diversification in CP-based local branching, Constraint programming-based column generation, The item dependent stockingcost constraint, Constraint programming-based column generation, On global warming: Flow-based soft global constraints, Semidefinite Programming and Constraint Programming