Abstract
We propose a new filtering algorithm for the cumulative constraint. It applies the Edge-Finding, the Extended-Edge-Finding and the Time-Tabling rules in O(k nlogn) where k is the number of distinct task heights. By a proper use of tasks decomposition, it enforces the Time-Tabling rule and the Time-Table Extended-Edge-Finding rule. Thus our algorithm improves upon the best known Extended-Edge-Finding propagator by a factor of O(logn) while achieving a much stronger filtering. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Ouellet, P., & Quimper, C. G. (2013). Time-table extended-edge-finding for the cumulative constraint. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8124 LNCS, pp. 562–577). https://doi.org/10.1007/978-3-642-40627-0_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
