Sign Up to like & get
recommendations!
1
Published in 2017 at "Journal of the Operational Research Society"
DOI: 10.1057/s41274-016-0146-7
Abstract: This paper develops a greedy heuristic for the capacitated minimum spanning tree problem (CMSTP), based on the two widely known methods of Prim and of Esau–Williams. The proposed algorithm intertwines two-stages: an enhanced combination of…
read more here.
Keywords:
heuristic capacitated;
tree problem;
greedy heuristic;
minimum spanning ... See more keywords
Sign Up to like & get
recommendations!
2
Published in 2022 at "PLoS ONE"
DOI: 10.1371/journal.pone.0270147
Abstract: Many real-life problems boil down to a variant of the Minimum Steiner Tree Problem (STP). In telecommunications, Fiber-To-The-Home (FTTH) houses are clustered so they can be connected with fiber as cost-efficiently as possible. The cost…
read more here.
Keywords:
steiner tree;
construction heuristic;
tree problem;
capacitated steiner ... See more keywords