An Efficient Node Partitioning Algorithm for the Capacitated Minimum Spanning Tree Problem

This paper studies the capacitated minimum spanning tree (CMST) problem, which is one of the most fundamental and significant problems in the optimal design of communication networks. A solution method using combined neighborhood search and branch and bound technique is introduced and its performance is presented. The advantage of the algorithm is shown while the process of searching for the optimal solution is illustrated. Computational experiences demonstrate that the proposed strategy significantly improves the efficiency of the previous node-orientated branch and bound algorithm.