✦ LIBER ✦

A Lagrangean approach to the degree-constrained minimum spanning tree problem

✍ Scribed by A. Volgenant

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 451 KB
Volume: 39
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(89)90169-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree-constrained minimum spanning tree

✍ Subhash C. Narula; Cesar A. Ho 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 868 KB

Edge exchanges in the degree-constrained

Edge exchanges in the degree-constrained minimum spanning tree problem

✍ Martin Savelsbergh; Ton Volgenant 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 725 KB

A branch and cut method for the degree-c

A branch and cut method for the degree-constrained minimum spanning tree problem

✍ L. Caccetta; S.P. Hill 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

Lower and upper bounds for the degree-co

Lower and upper bounds for the degree-constrained minimum spanning tree problem

✍ Alexandre Salles da Cunha; Abilio Lucena 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

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

Minimum-weight degree-constrained spanni

Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine

✍ Bruce Boldon; Narsingh Deo; Nishit Kumar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 1005 KB