Owing to its inherent difficulty many heuristic solution methods have been proposed for the capacitated minimum spanning tree problem. On the basis of recent developments it is clear that the best metaheuristic implementations outperform classical heuristics. Unfortunately they require long computing times and may not be very easy to implement which explains the popularity of the Esau and Williams heuristic in practice and the motivation behind its enhancements. Some of these enhancements involve ...