Name
Title | ||
|---|---|---|
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem. |
Abstract | ||
|---|---|---|
•We introduce optimality cuts for the K-rooted mini-max spanning forest problem.•Optimality cuts are used within a new branch-and-cut algorithm.•Extensive computational testings with the new method are carried out.•With such an algorithm we are able to substantially improve previous results on the problem. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ejor.2015.05.001 | European Journal of Operational Research |
Keywords | Field | DocType |
Combinatorial optimization,Branch-and-cut,K-rooted mini–max spanning forest problem,Optimality cuts | Mathematical optimization,Combinatorics,Minimum degree spanning tree,Vertex (geometry),Branch and cut,Algorithm,Combinatorial optimization,Linear programming,Spanning tree,Shortest-path tree,Mathematics,Minimum spanning tree | Journal |
Volume | Issue | ISSN |
246 | 2 | 0377-2217 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandre Salles da Cunha | 1 | 242 | 22.32 |
| Luidi Simonetti | 2 | 152 | 15.82 |
| Abilio Lucena | 3 | 362 | 34.05 |