𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem

✍ Scribed by Yong-Jin Lee; M. Atiquzzaman


Book ID
108100530
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
195 KB
Volume
28
Category
Article
ISSN
0140-3664

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Models and heuristics for the k -degree
✍ Christophe Duhamel; LuΓ­s Gouveia; Pedro Moura; MaurΓ­cio de Souza πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 319 KB πŸ‘ 1 views

## Abstract The __k__ ‐Degree constrained Minimum Spanning Tree Problem (__k__ ‐DMSTP) consists in finding a minimal cost spanning tree satisfying the condition that every node has a degree no greater than a fixed value __k__. Here we consider an extension where besides the edge costs, a concave co