๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Finding minimum cost directed trees with demands and capacities

โœ Scribed by Choaib Bousba; Laurence A. Wolsey


Book ID
112688029
Publisher
Springer US
Year
1991
Tongue
English
Weight
817 KB
Volume
33
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A new heuristic algorithm for finding mi
โœ Anna Haฤ‡; Kelei Zhou ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 246 KB

## This article presents a new heuristic algorithm called DDBMA (Dynamic Delay Bounded Multicast Algorithm) to construct a minimum-cost multicast tree. The heuristic depends on (1) bounded delay along paths from source nodes to each destination node; (2) minimum cost of the multicast tree; (3) dyn