✦ LIBER ✦

A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem

✍ Scribed by Marshall L. Fisher

Book ID: 123687612
Publisher: INFORMS
Year: 1994
Tongue: English
Weight: 236 KB
Volume: 42
Category: Article
ISSN: 0030-364X
DOI: 10.2307/171629

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparison of Algorithms for the Degree

Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree

✍ Mohan Krishnamoorthy; Andreas T. Ernst; Yazid M. Sharaiha 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 163 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

A LEARNING AUTOMATA-BASED ALGORITHM TO T

A LEARNING AUTOMATA-BASED ALGORITHM TO THE STOCHASTIC MIN-DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM

✍ TORKESTANI, JAVAD AKBARI 📂 Article 📅 2013 🏛 World Scientific Publishing Company 🌐 English ⚖ 365 KB

Degree constrained minimum spanning tree

Degree constrained minimum spanning tree problem: a learning automata approach

✍ Javad Akbari 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 701 KB

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

The min-degree constrained minimum spann

The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm

✍ Martinez, Leonardo Conegundes; da Cunha, Alexandre Salles 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 398 KB