Improved algorithm for the soft global cardinality constraint

Authors:
Alessandro Zanarini;Michela Milano;Gilles Pesant
Affiliations:
Département de génie informatique, École Polytechnique de Montréal, Montreal, Canada;D.E.I.S., Universitá di Bologna, Bologna, Italy;Département de génie informatique, École Polytechnique de Montréal, Montreal, Canada
Venue:
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2006

Citing 7
Cited 7

Possibilistic constraint satisfaction problems or “how to handle soft constraints?”

UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Arc Consistency for Global Cardinality Constraints with Costs

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Specific Filtering Algorithms for Over-Constrained Problems

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Node and arc consistency in weighted CSP

Eighteenth national conference on Artificial intelligence
On global warming: Flow-based soft global constraints

Journal of Heuristics
In the quest of the best form of local consistency for weighted CSP

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Softening Gcc and Regular with preferences

Proceedings of the 2009 ACM symposium on Applied Computing
Reformulating global constraints: the slide and regular constraints

SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Constraint logic programming

A 25-year perspective on logic programming
Revisiting the soft global cardinality constraint

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Dulmage-Mendelsohn Canonical Decomposition as a generic pruning technique

Constraints
Counting-based search: branching heuristics for constraint satisfaction problems

Journal of Artificial Intelligence Research
Underestimating the cost of a soft constraint is dangerous: revisiting the edit-distance based soft regular constraint

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. They are based on graph theory and their complexity is $O(\sqrt{n}m)$ where n is the number of variables and m is the sum of the cardinalities of the domains. They improve previous algorithms that ran respectively in O(n(m+nlog n)) and O((n+k)(m+nlog n)) where k is the cardinality of the union of the domains.