The Capacitated Minimum Spanning Tree
- 1 January 1973
- Vol. 3 (2), 173-181
- https://doi.org/10.1002/net.3230030204
Abstract
The capacitated minimum spanning tree is an offspring of the minimum spanning tree and network flow problems. It has application in the design of multipoint linkages in elementary teleprocessing tree networks. Some theorems are used in conjunction with Little's branch and bound algorithm to obtain optimal solutions. Computational results are provided to show that the problem is tractable.Keywords
This publication has 5 references indexed in Scilit:
- The Design or Multipoint Linkages in a Teleprocessing Tree NetworkIEEE Transactions on Computers, 1972
- Optimal assignments in an ordered set: An application of matroid theoryJournal of Combinatorial Theory, 1968
- On teleprocessing system design, Part II: A method for approximating the optimal networkIBM Systems Journal, 1966
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- A note on two problems in connexion with graphsNumerische Mathematik, 1959