Pruning for the cardinality-path Constraint Family
Number of Authors: 1
2000 (English)Report (Refereed)
This paper presents generic propagation algorithms for the cardinality-path constraint family. This is a restricted form of the cardinality operator that allows stating constraints on sliding sequences of consecutive variables. Taking advantage of these restrictions permits coming up with more efficient algorithms. Moreover the paper shows how to extend these propagation algorithms in order to partially integrate external constraints that have to hold. From an application point of view the cardinality-path constraint allows to express a huge variety of regulation constraints occurring in personnel planning problems.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2000, 1. , 13 p.
SICS Technical Report, ISSN 1100-3154 ; T2000:11A
Global constraint, cardinality, timetabling
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22016OAI: oai:DiVA.org:ri-22016DiVA: diva2:1041558
This revised edition of the SICS report T2000/11 incorporates one correction as well as some minor improvements.2016-10-312016-10-31Bibliographically approved