✦ LIBER ✦

Edge exchanges in the degree-constrained minimum spanning tree problem

✍ Scribed by Martin Savelsbergh; Ton Volgenant

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 725 KB
Volume: 12
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(85)90032-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lagrangean approach to the degree-cons

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

✍ A. Volgenant 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 451 KB

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

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

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

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

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