Change search
ReferencesLink to record
Permanent link

Direct link
Pruning for the minimum Constraint Family and for the Number of Distinct Values Constraint Family
Number of Authors: 1
2000 (English)Report (Refereed)
Abstract [en]

The paper presents propagation rules that are common to the minimum constraint family and to the number of distinct values constraint family. One original contribution is to provide a geometrical interpretation of these rules that can be used by a generic sweep pruning algorithm. Finally one practical interest of the paper is to describe an implementation of the number of distinct values constraint. This is a quite common counting constraint that one encounters in many practical applications such as timetabling or frequency allocation problems.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2000, 1. , 18 p.
Series
SICS Technical Report, ISSN 1100-3154 ; 2000:10
Keyword [en]
Global constraint, Minimum, Number of distinct values
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22014OAI: oai:DiVA.org:ri-22014DiVA: diva2:1041556
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

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

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 3 downloads
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