Computing a maximum cardinality matching in a bipartite graph in time On1.5m/logn
Information Processing Letters
A practical use of Jackson's preemptive schedule for solving the job shop problem
Annals of Operations Research
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint
CP '01 Proceedings of the 7th 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
A new constraint programming approach for the orthogonal packing problem
Computers and Operations Research
Multi-dimensional bin packing problems with guillotine constraints
Computers and Operations Research
Sweeping with continuous domains
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Consecutive Ones Matrices for Multi-dimensional Orthogonal Packing Problems
Journal of Mathematical Modelling and Algorithms
CROSS cyclic resource-constrained scheduling solver
Artificial Intelligence
| Hi-index | 0.01 |
This paper presents a new generic filtering algorithm which simultaneously considers n conjunctions of constraints as well as those constraints mentioning some variables Yk of the pairs X, Yk (1≤k≤n) occurring in these conjunctions. The main benefit of this new technique comes from the fact that, for adjusting the bounds of a variable X according to n conjunctions, we do not perform n sweeps in an independent way but rather synchronize them. We then specialize this technique to the non-overlapping rectangles constraint where we consider the case where several rectangles of height one have the same X coordinate for their origin as well as the same length. For this specific constraint we come up with an incremental bipartite matching algorithm which is triggered while we sweep over the time axis. We illustrate the usefulness of this new pruning method on a timetabling problem, where each task cannot be interrupted and requires the simultaneous availability of n distinct persons. In addition each person has his own periods of unavailability and can only perform one task at a time.