✦ LIBER ✦

On the generalized minimum spanning tree problem

✍ Scribed by Young-Soo Myung; Chang-Ho Lee; Dong-Wan Tcha

Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 748 KB
Volume: 26
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230260407

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the minimum diameter spanning tree pr

On the minimum diameter spanning tree problem

✍ Refael Hassin; Arie Tamir 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 199 KB

The quadratic minimum spanning tree prob

The quadratic minimum spanning tree problem

✍ Arjang Assad; Weixuan Xu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 893 KB

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

The generalized minimum spanning tree pr

The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm

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

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

The most vital edges in the minimum span

The most vital edges in the minimum spanning tree problem

✍ Kao-Chêng Lin; Maw-Sheng Chern 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 490 KB