Name
Title | ||
|---|---|---|
Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem |
Abstract | ||
|---|---|---|
Assume that a connected undirected edge weighted graph G is given. The Degree Constrained Minimum Spanning Tree Problem (DCMSTP) asks for a minimum cost spanning tree of G where vertex degrees do not exceed given pre-defined upper bounds. In this paper, three exact solution algorithms are investigated for the problem. All of them are Branch-and-cut based and rely on the strongest formulation currently available for the problem. Additionally, to speed up the computation of dual bounds, they all use column generation, in one way or another. To test the algorithms, new hard to solve DCMSTP instances are proposed here. These instances, combined with additional ones taken from the literature, are then used in computational experiments. The experiments compare the new algorithms among themselves and also against the best algorithms currently available in the literature. As an outcome of them, one of the new algorithms stands out on top. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s10589-015-9788-7 | Computational Optimization and Applications |
Keywords | Field | DocType |
Degree Constrained Spanning Tree,Branch-and-cut,Branch-and-cut-and-price | Mathematical optimization,Distributed minimum spanning tree,k-minimum spanning tree,Euclidean minimum spanning tree,Algorithm,Degree-constrained spanning tree,Connected dominating set,Spanning tree,Shortest-path tree,Mathematics,Minimum spanning tree | Journal |
Volume | Issue | ISSN |
63 | 3 | 0926-6003 |
Citations | PageRank | References |
4 | 0.45 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| luis henrique bicalho | 1 | 4 | 0.45 |
| Alexandre Salles da Cunha | 2 | 242 | 22.32 |
| Abilio Lucena | 3 | 362 | 34.05 |