Paper Info
Title
Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm
Abstract
In this paper, two formulations for the Min-degree Constrained Minimum Spanning Tree Problem, one based on undirected Subtour Elimination Constraints and the other on Directed Cutset inequalities, are discussed. The quality of the Linear Programming bounds provided by them is addressed and a Branch-and-cut algorithm based on the strongest is investigated. Our computational experiments indicate that the method compares favorably with other exact and heuristic approaches in the literature, in terms of solution quality and execution times. Several new optimality certificates and new best upper bounds are provided here.
Year
DOI
Venue
2010
10.1016/j.endm.2010.05.040
Electronic Notes in Discrete Mathematics
Keywords
Field
DocType
Min-degree Constrained Minimum Spanning Tree Problem,Branch-and-cut
Distributed minimum spanning tree,Prim's algorithm,Spanning tree,Reverse-delete algorithm,Kruskal's algorithm,Minimum spanning tree,Discrete mathematics,Combinatorics,Mathematical optimization,Edmonds' algorithm,Algorithm,Shortest-path tree,Mathematics
Journal
Volume
ISSN
Citations 
36
1571-0653
4
PageRank 
References 
Authors
0.47
4
2
Name
Order
Citations
PageRank
Leonardo Conegundes Martinez1201.89
Alexandre Salles da Cunha224222.32