This paper contributes to the computational study of the Maximum-Weight Bounded-Degree Rooted Tree Problem. Based on previous work, two types of formulations are introduced for the problem, along with some newly discovered constraints that can enhance the formulations. The separation problem for each family of constraints are studied in terms of their complexity and associated algorithms. We then compare the performance of four branch-and-cut frameworks in extensive computational simulations, especially the performance difference between origin...
