𝔖 Bobbio Scriptorium
✦   LIBER   ✦

RAMP for the capacitated minimum spanning tree problem

✍ Scribed by Cesar Rego; Frank Mathew; Fred Glover

Publisher
Springer US
Year
2010
Tongue
English
Weight
419 KB
Volume
181
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Capacitated Minimum Spanning Tree
The Capacitated Minimum Spanning Tree
✍ K. M. Chandy; Tachen Lo πŸ“‚ Article πŸ“… 1973 πŸ› John Wiley and Sons 🌐 English βš– 386 KB

## 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 algorith

A hierarchy of hop-indexed models for th
A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem
✍ Gouveia, Luis; Martins, Pedro πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 143 KB πŸ‘ 2 views

The Capacitated Minimum Spanning Tree Problem (CMSTP) is to find a minimum spanning tree subject to an additional constraint stating that the number of nodes in each subtree pending from a given root node is not greater than a given number Q. Gouveia and Martins (1996) proposed a hop-indexed flow mo