Title
Solving the optimum communication spanning tree problem.
Abstract
•We present an exact algorithm based on Benders decomposition for the problem.•We employ several algorithmic features to speed-up its convergence.•Savings of up to three orders of magnitude compared to state-of-the-art algorithms.
Year
DOI
Venue
2019
10.1016/j.ejor.2018.07.055
European Journal of Operational Research
Keywords
Field
DocType
Networks,Network optimization,Benders decomposition,Spanning trees
Mathematical optimization,Heuristics,Spanning tree,Benders' decomposition,Mathematics,Branching (version control)
Journal
Volume
Issue
ISSN
273
1
0377-2217
Citations 
PageRank 
References 
0
0.34
27
Authors
4
Name
Order
Citations
PageRank
Carlos Armando Zetina100.34
Ivan Contreras230717.90
Elena Fernández315710.37
Carlos Luna-Mota450.78