P. C. Pop, A survey of different integer programming formulations of the generalized minimum spanning tree problem, Carpathian Journal of Mathematics, Vol. 25, No. 1 (2009), pp. 104-118 ...

The Esau-Williams algorithm is one of the best known heuristics for the capacitated minimum spanning tree problem. This paper describes a simple enhancement of this heuristic. On benchmark test ...

Minimum Cost Spanning Tree (MCST): A network structure connecting all nodes with the minimum total cost, widely used in the optimisation of network design problems.