Extended formulations for the cardinality constrained subtree of a tree problem

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.