zbMATH — the first resource for mathematics

The taskintersection constraint. (English) Zbl 06598669
Quimper, Claude-Guy (ed.), Integration of AI and OR techniques in constraint programming. 13th international conference, CPAIOR 2016, Banff, AB, Canada, May 29 – June 1, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-33953-5/pbk; 978-3-319-33954-2/ebook). Lecture Notes in Computer Science 9676, 246-261 (2016).
Summary: Given a sequence of tasks \(\mathcal {T}\) subject to precedence constraints between adjacent tasks, and given a set of fixed intervals \(\mathcal {I}\), the TaskIntersection \((\mathcal {T},\mathcal {I},o, inter )\) constraint restricts the overall intersection of the tasks of \(\mathcal {T}\) with the fixed intervals of \(\mathcal {I}\) to be greater than or equal \((o= ` \geq ')\) or less than or equal \((o= ` \leq ')\) to a given limit \( inter \). We provide a bound \((\mathbb {Z})\)-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.
For the entire collection see [Zbl 1337.68017].

68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
90C27 Combinatorial optimization
Full Text: DOI