The TaskIntersection Constraint - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

The TaskIntersection Constraint


Given a sequence of tasks T subject to precedence constraints between adjacent tasks, and given a set of fixed intervals I, the TaskIntersection (T,I,o,inter) constraint restricts the overall intersection of the tasks of T with the fixed intervals of I to be greater than or equal (o= ‘≥’) or less than or equal (o= ‘≤’) to a given limit inter. We provide a bound(ℤ)-consistent cost filtering algorithm wrt the starts and the ends of the tasks for the TaskIntersection constraint and evaluate the constraint on the video summarisation problem.


Not file

Dates and versions

hal-01436044 , version 1 (16-01-2017)



Gilles Madi Wamba, Nicolas Beldiceanu. The TaskIntersection Constraint. 13th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming - CPAIOR 2016, May 2016, Banff, Canada. pp.246-261, ⟨10.1007/978-3-319-33954-2_18⟩. ⟨hal-01436044⟩
277 View
0 Download



Gmail Facebook Twitter LinkedIn More