✦ LIBER ✦

Network flow models for designing diameter-constrained minimum-spanning and Steiner trees

✍ Scribed by Luis Gouveia; Thomas L. Magnanti

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 184 KB
Volume: 41
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.10069

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A 2-path approach for odd-diameter-const

A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees

✍ Luis Gouveia; Thomas L. Magnanti; Cristina Requejo 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB

Models and heuristics for the k -degree

Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs

✍ 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