The multi-inter-distance constraint

Authors:
Pierre Ouellet;Claude-Guy Quimper
Affiliations:
Université Laval, Département d'informatique et de génie Logiciel;Université Laval, Université Laval, Département d'informatique et de génie Logiciel
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Year:
2011

Citing 6
Cited 0

A filtering algorithm for constraints of difference in CSPs

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

Introduction to Algorithms
Edge Finding for Cumulative Scheduling

INFORMS Journal on Computing
A quadratic propagator for the inter-distance constraint

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Edge finding filtering algorithm for discrete cumulative resources in O(kn log n)

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the MULTI-INTER-DISTANCE constraint that ensures no more than m variables are assigned to values lying in a window of p consecutive values. This constraint is useful for modeling scheduling problems where tasks of processing time p compete for m identical resources. We present a propagator that achieves bounds consistency in cubic time. Experiments show that this new constraint offers a much stronger filtering than an edge-finder and that it allows to solve larger instances of the runway scheduling problem.