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.
Chapter PDF
Similar content being viewed by others
References
Ahuja, R.K., J. B. Orlin and D. Sharma. 2000. Very large-scale neighborhood Search. Operational Research, 7: 301–317.
Altinkemer, K. and B. Gavish. 1988. Heuristics with constant error guarantees for the design of tree networks. Management Science, 32: 331–341.
Amberg, A., W. Domscheke and S. Braunschweig. 1996. Capacitated Minimum Spanning Trees: Algorithms using intelligent search. Combinatorial optimization: Theory and Practice, 1:9–39.
Chandy, K.M. and R.A. Russell. 1972. The design of multipoint linkages in a teleprocessing tree network. IEEE Transactions on Computers, 21: 1062–1066.
Chandy, K.M.and T. Lo. 1973. The capacitated minimum spanning tree. Networks, 3: 173–181.
Elias, D. and M.J. Ferguson. 1974. Topological design of multipoint teleprocessing networks. IEEE Transactions on Communications, 22: 1753–1762.
Frank, H., I.T. Frisch, R. Van Slyke and W.S. Chou. 1971. Optimal design of centralized computer design network. Networks, 1: 43–57.
Gavish, B. 1991. Topological design of telecommunication networks-local access design methods. Annals of Operations Research, 33: 17–71.
Gavish, B. and K. Altinkemer. 1986. Parallel savings heuristics for the topological design of local access tree networks. Proc. IEEE INFOCOM 86 Conference, 130–139.
Gouveia, L. and P. Martins. 1995. An extended flow based formulation for the capacitated minimum spanning tree, presented at the third ORSA Telecommunications Conference, Boca Raton, FL.
Gouveia, L. and J. Paixao. 1991. Dynamic programming based heuristics for the topological design of local access networks. Annals of Operations Research, 33: 305–327.
Hall, L. 1996. Experience with a cutting plane algorithm for the capacitated spanning tree problem. INFORMS Journal on Computing, 8(3): 219–234.
Karnaugh, M. 1976. A new class of algorithms for multipoint network optimization. IEEE Transactions on Communications, 24: 500–505.
Kershenbaum, A. and P.R. Boorstyn. 1983. Centralized teleprocessing network design. Networks, 13: 279–293.
Malik, K. and G. Yu 1993. A branch and bound algorithm for the capacitated minimum spanning tree problem. Networks, 23: 525–532.
Papadimitriou, C.H. 1978. The Complexity of the capacitated tree problem. Networks, 8: 217–230.
Schneider, G.M. and M. N. Zastrow. 1982. An algorithm for the design of multilevel concentrator networks. Computer Networks, 6: 1–11.
Thangiah, S.R., I.H. Osman and T. Sun. 1994. Hybrid genetic algorithms, simulated annealing and tabu search methods for vehicle routing problems with time windows. Working Paper, Univ. of Kent, Canterbury.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, J., McMahon, G., Sugden, S. (2002). A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem. In: Monien, B., Feldmann, R. (eds) Euro-Par 2002 Parallel Processing. Euro-Par 2002. Lecture Notes in Computer Science, vol 2400. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_54
Download citation
DOI: https://doi.org/10.1007/3-540-45706-2_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44049-9
Online ISBN: 978-3-540-45706-0
eBook Packages: Springer Book Archive