Change search
ReferencesLink to record
Permanent link

Direct link
Filtering methods for symmetric cardinality constraint
Number of Authors: 2
2003 (English)Report (Refereed)
Abstract [en]

The symmetric cardinality constraint is described in terms of variables X = {x_1,...,x_k} which take values in the subset of values V={v_1,...,v_n}. It constraints the number of times a value can be assigned to a variable in X to be in an interval [l_{x_i},c_{x_i}] and at the same time it restricts the number of values in V which any variable can take to an interval [l_{v_j},c_{v_j}]. 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.

Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 2003, 1. , 8 p.
SICS Technical Report, ISSN 1100-3154 ; 2003:10
Keyword [en]
constraint programming, global constraints, flowtheory
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14246OAI: diva2:1035534
Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(180 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 180 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link