Optimizing constrained subtrees of trees |
| |
Authors: | El Houssaine Aghezzaf Thomas L. Magnanti Laurence A. Wolsey |
| |
Affiliation: | (1) Faculté Universitaire Catholique de Mons, Belgium;(2) Sloan School of Management and School of Engineering, MIT, Cambridge, United States;(3) CORE, Université Catholique de Louvain, Belgium;(4) Present address: Operations Research Center, Massachusetts Institute of Technology, Room E40-147, One Amherst Street, 02139-9307 Cambridge, MA, United States |
| |
Abstract: | Given a treeG = (V, E) and a weight function defined on subsets of its nodes, we consider two associated problems. The first, called the rooted subtree problem, is to find a maximum weight subtree, with a specified root, from a given set of subtrees.The second problem, called the subtree packing problem, is to find a maximum weight packing of node disjoint subtrees chosen from a given set of subtrees, where the value of each subtree may depend on its root.We show that the complexity status of both problems is related, and that the subtree packing problem is polynomial if and only if each rooted subtree problem is polynomial. In addition we show that the convex hulls of the feasible solutions to both problems are related: the convex hull of solutions to the packing problem is given by pasting together the convex hulls of the rooted subtree problems.We examine in detail the case where the set of feasible subtrees rooted at nodei consists of all subtrees with at mostk nodes. For this case we derive valid inequalities, and specify the convex hull whenk 4.Research supported in part by Nato Collaborative Research Grant CRG 900281, Science Program SC1-CT91-620 of the EEC, and contract No 26 of the programme Pôle d'attraction interuniversitaire of the Belgian government. |
| |
Keywords: | Polyhedral combinatorics Packing subtrees Knapsacks with precedence Column generation Dynamic programming |
本文献已被 SpringerLink 等数据库收录! |
|