optional · interactive figures

Explore: global constraints

The deck's example: no free value; one component {x1, x2, 1, 2}; four removals.
With a free value: value 5 is matched to nobody, so every edge on a path to it is kept, and x3 still loses 1 and 2 to the Hall set {x1, x2}.

Régin's matching-based filter one stage at a time, and a cumulative resource whose windows you can squeeze.

optional: nothing in the lab depends on itback to the slides

18 · explore

Régin's filter, step by step

Try: step from the value graph to the removed edges; then pick the run with a free value, where edges on a path to it survive. Static version: Régin's filter, on the example.

18 · explore

Compulsory parts and the profile

Try: pin C to start 2 (earliest = latest = 2) and the resource overloads; pin C to 4 and A to 2, and B loses start 2. Static version: A profile for three tasks.