A computational study on the Maximum-Weight Bounded-Degree Rooted Tree Problem
作者：
Highlights：
• This paper studies the Maximum-Weight Bounded-Degree Rooted Tree Problem from the computational aspect.
• Basic models and enhanced constraints are introduced for compact and extended models.
• Separation problems and algorithms are studied for each family of constraints.
• Several branch-and-cut frameworks are proposed and tested to compare the performance.
• Enhanced formulations show superior performance in computational simulation.
摘要
•This paper studies the Maximum-Weight Bounded-Degree Rooted Tree Problem from the computational aspect.•Basic models and enhanced constraints are introduced for compact and extended models.•Separation problems and algorithms are studied for each family of constraints.•Several branch-and-cut frameworks are proposed and tested to compare the performance.•Enhanced formulations show superior performance in computational simulation.
论文关键词：Bounded-degree rooted tree,Branch-and-cut algorithm,Separation
论文评审过程：Received 12 November 2020, Revised 22 April 2021, Accepted 22 August 2021, Available online 7 September 2021, Version of Record 7 September 2021.
论文官网地址：https://doi.org/10.1016/j.amc.2021.126623
