A simple enhancement of the Esau–Williams heuristic for the capacitated minimum spanning tree problem
对Esau-Williams启发式算法做了简单改进，在基准测试中几乎总能得到更优解，且计算时间增加不大，改进效果显著。
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 problems, the modified method does not result in much larger computation times and almost always produces lower solution values than does the Esau–Williams algorithm. The improvements are often significant.