A greedy heuristic for the capacitated minimum spanning tree problem
Sign Up to like & getrecommendations! 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
An Approximation Algorithm for the Balanced Capacitated Minimum Spanning Tree Problem
Sign Up to like & getrecommendations! Published in 2020 at "Scientia Iranica"
DOI: 10.24200/sci.2020.54242.3663
Abstract: The capacitated minimum spanning tree problem (CMSTP), a well-known combinatorial optimiza- tion problem, holds a central place in telecommunication network design. This problem is to fi nd a minimum cost spanning tree with an extra… read more here.
Keywords: problem; tree problem; spanning tree; minimum spanning ... See more keywords