✦ LIBER ✦

A characterization of Kruskal sharing rules for minimum cost spanning tree problems

✍ Scribed by Leticia Lorenzo; Silvia Lorenzo-Freire

Publisher: Springer-Verlag
Year: 2008
Tongue: English
Weight: 296 KB
Volume: 38
Category: Article
ISSN: 0020-7276
DOI: 10.1007/s00182-008-0147-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of optimistic weighte

A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems

✍ Gustavo Bergantiños; Silvia Lorenzo-Freire 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 216 KB

The family of cost monotonic and cost ad

The family of cost monotonic and cost additive rules in minimum cost spanning tree problems

✍ Gustavo Bergantiños; Leticia Lorenzo; Silvia Lorenzo-Freire 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 203 KB

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

A comparative analysis of several formul

A comparative analysis of several formulations for the generalized minimum spanning tree problem

✍ Corinne Feremans; Martine Labbé; Gilbert Laporte 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 423 KB 👁 1 views