Sciweavers

Share
CONSTRAINTS
2008

Combining Tree Partitioning, Precedence, and Incomparability Constraints

8 years 10 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requirements on tree count, node degrees, or precedences and incomparabilities within node subsets. We present a generalisation of the tree constraint that incorporates such side constraints. The key point of our approach is to take partially into account the strong interactions between the tree partitioning problem and all the side constraints, in order to avoid thrashing during search. We describe filtering rules for this extended tree constraint and evaluate its effectiveness on three applications: the Hamiltonian path problem, the ordered disjoint paths problem, and the phylogenetic supertree problem.
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CONSTRAINTS
Authors Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
Comments (0)
books