Sciweavers

Share
CPAIOR
2006
Springer

Improved Algorithm for the Soft Global Cardinality Constraint

10 years 1 months ago
Improved Algorithm for the Soft Global Cardinality Constraint
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( nm) 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+n log n)) and O((n + k)(m + n log n)) where k is the cardinality of the union of the domains.
Alessandro Zanarini, Michela Milano, Gilles Pesant
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where CPAIOR
Authors Alessandro Zanarini, Michela Milano, Gilles Pesant
Comments (0)
books