Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142839 | Operations Research Letters | 2009 | 5 Pages |
Abstract
Given a tree with nn nodes, we consider the problem of finding the most profitable subtree of that tree with at most KK nodes which is known as the Cardinality Subtree of a Tree Problem. We present a new exact linear extended formulation with O(nK)O(nK) two-indexed variables and O(nK)O(nK) constraints.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
A. Agra, L. Gouveia, C. Requejo,