A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem

This paper studies the capacitated minimum spanning tree problem (CMST), which is one of the most fundamental and significant problems in the optimal design of communication networks. CMST has a great variety of applications, such as in the design of local access networks, the design of minimum cost teleprocessing networks, the vehicle routing and so on. A solution method using branch and bound technique is introduced. Computational experiences demonstrate the algorithm’s effectiveness.