190 search results - page 1 / 38 » Improved Algorithm for the Soft Global Cardinality Constrain... |
CPAIOR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We describe soft versions of the global cardinality constraint and the regular constraint, with efficient filtering algorithms maintaining domain consistency. For both constraints,...
CP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We study the global cardinality constraint (gcc) and pro
HEURISTICS
2006
13 years 4 months ago
2006
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...
CP
2004
Springer
13 years 8 months ago
2004
Springer
This paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flo...