✦ LIBER ✦

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

✍ Scribed by Luis Gouveia; Luidi Simonetti; Eduardo Uchoa

Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 452 KB
Volume: 128
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-009-0297-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An intersecting tree model for odd-diame

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

✍ Luis Gouveia; Thomas L. Magnanti; Cristina Requejo 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 442 KB

Network flow models for designing diamet

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

✍ Luis Gouveia; Thomas L. Magnanti 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 184 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