A Filtering Algorithm for the Stretch Constraint

Authors:
Gilles Pesant
Affiliations:
-
Venue:
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Year:
2001

Citing 1
Cited 8

A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)

Solving necklace constraint problems

Journal of Algorithms
Solving Necklace Constraint Problems

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Graph properties based filtering

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Constraint programming based column generation for employee timetabling

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Improving the cooperation between the master problem and the subproblem in constraint programming based column generation

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The increasing nvalue constraint

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A generalized arc-consistency algorithm for a class of counting constraints

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a filtering algorithm for a type of constraint that often arises in rostering problems but that also has wider application. Defined on a sequence of variables, the stretch constraint restricts the number of consecutive identical values in the sequence. The algorithm mainly proceeds by determining intervals in which a given stretch must lie and then reasoning about them to filter out values. It is shown to have low time complexity and significant pruning capability as evidenced by experimental results.