SODA

Filtering methods for symmetric cardinality constraint

Kocjan, Waldemar and Kreuger, Per (2004) Filtering methods for symmetric cardinality constraint. In: First International Conference (PAIOR 2004), April 2004, Nice, France.

Full text not available from this repository.

Abstract

The symmetric cardinality constraint is described in terms of a set of variables X={x1,...,xk}, which take their values as subsets of values V={v1,...,vn}. It constraints the cardinality of the set assigned to each variable to be in an interval [lxi,cxi] and at the same time it restricts the number of occurrences of each value vj in V in the sets assigned to variables in X to be in an other interval [lvj,cvj]. In this paper we introduce the symmetric cardinality constraint and define set constraint satisfaction problem as a framework for dealing with this type of constraints. Moreover, we present effective filtering methods for the symmetric cardinality constraint.

Item Type:Conference or Workshop Item (Paper)
Additional Information:Lecture Notes in Computer Science (3011),Springer. ISBN 978-3-540-21836-4
ID Code:2747
Deposited By:INVALID USER
Deposited On:18 Mar 2008
Last Modified:24 Aug 2010 14:30

Repository Staff Only: item control page