SODA

Pruning for the cardinality-path Constraint Family

Beldiceanu, Nicolas (2000) Pruning for the cardinality-path Constraint Family. [SICS Report]

[img]Postscript
170Kb
[img]
Preview
PDF
83Kb

Abstract

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.

Item Type:SICS Report
Additional Information:This revised edition of the SICS report T2000/11 incorporates one correction as well as some minor improvements.
Uncontrolled Keywords:Global constraint, cardinality, timetabling
ID Code:2294
Deposited By:Vicki Carleson
Deposited On:30 Jul 2009
Last Modified:18 Nov 2009 16:04

Repository Staff Only: item control page