✦ LIBER ✦

An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem

✍ Scribed by Alok Singh

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 147 KB
Volume: 9
Category: Article
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2008.09.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(log m) parallel algorithm for the m

An O(log m) parallel algorithm for the minimum spanning tree problem

✍ Francis Suraweera; Prabir Bhattacharya 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 481 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 bound algorithm for the cap

A branch and bound algorithm for the capacitated minimum spanning tree problem

✍ Kavindra Malik; Gang Yu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 630 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

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

An O(m log n) algorithm for the max + su

An O(m log n) algorithm for the max + sum spanning tree problem

✍ Abraham P. Punnen; K.P.K. Nair 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 240 KB