A computational study on the Maximum-Weight Bounded-Degree Rooted Tree Problem

Hervé Kerivin and Jinhua Zhao

Applied Mathematics and Computation, 2022, vol. 413, issue C

Abstract: 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.

Keywords: Bounded-degree rooted tree; Branch-and-cut algorithm; Separation (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321007074
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:413:y:2022:i:c:s0096300321007074

DOI: 10.1016/j.amc.2021.126623

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().