A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem (Research Note)

Authors:
Jun Han;Graham McMahon;Stephen Sugden
Affiliations:
-;-;-
Venue:
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Year:
2002

Citing 2
Cited 0

Heuristics with constant error guarantees for the design of tree networks

Management Science
The Design or Multipoint Linkages in a Teleprocessing Tree Network

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.