Constraint Propagation

As in Waltz filtering, constraint propagation can greatly reduce the size of a CSP search:

Some search may be left after constraint propagation, but the amount of search can be greatly reduced.

For scheduling problems, possible value sets can be represented as ranges [ min, max ]; constraints can allow the range limits to be reduced.

Contents    Page-10    Prev    Next    Page+10    Index