TreeSConstraint |
A global tree partitioning constraint that deals with several restrictions:
- The number of trees allowed to partition the graph (assuming an isolated node forms
a tree),
- The number of proper trees allowed to partition the graph (assuming a proper tree
contains at least 2 nodes),
- Partial order between the nodes of the digraph,
- Incomparability relations between the nodes of the digraph,
- Degree restrictions related to the number of incoming arc of each node,
- Time windows associated with each node that represent the starting time from each
node. |