Extension of O(n log n) filtering algorithms for the unary resource constraint to optional activities

Abstrakt

The paper describes several new O(n.log n) filtering algorithms for modelling unary resource constraints with optional activities