SODA

Pruning for the cardinality-path constraint family

Beldiceanu, Nicolas (2001) Pruning for the cardinality-path constraint family. In: Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems: CP-AI-OR 2001, 8-10 April 2001, Wye College (Imperial College), Ashford, Kent UK.

Full text not available from this repository.

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:Conference or Workshop Item (Paper)
ID Code:3065
Deposited By:INVALID USER
Deposited On:15 Jul 2008
Last Modified:18 Nov 2009 16:17

Repository Staff Only: item control page