The Esau-Williams algorithm is one of the best known heuristics for the Capacitated Minimum Spanning Tree Problem. This research note 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.
Published February 2001 , 10 pages
This cahier was revised in May 2001