Optimal subtrees and extensions

We consider the problem of finding an optimal family of nested rooted subtrees of a tree. We give a linear algorithm for the associated 1.p. for this problem. A generalization of this problem is that of finding an optimal "lower closed set" of nodes in an acyclic graph for which polyhedral and polarity characterization are given. these problem are useful relaxations when solving more complicated sequencing problems.


Published in:
Annals of Discrete Mathematics, 16, 121-127
Year:
1982
Note:
PRO 82.01
Laboratories:




 Record created 2006-02-13, last modified 2018-01-27


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)