.png){kind=icon}
返回
A computational study on the Maximum-Weight Bounded-Degree Rooted Tree Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2021.126623.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 original models and enhanced models with newly discovered constraints. Results show that the enhanced models have a significantly better performance than the original ones. (C) 2021 Elsevier Inc. All rights reserved.
Keyword:
Bounded-degree rooted tree
Branch-and-cut algorithm
Separation
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容