✦ LIBER ✦

A Simple Enhancement of the Esau-Williams Heuristic for the Capacitated Minimum Spanning Tree Problem

✍ Scribed by G. Bruno and G. Laporte

Book ID: 125586469
Publisher: Palgrave Publishers Ltd.
Year: 2002
Tongue: English
Weight: 180 KB
Volume: 53
Category: Article
ISSN: 0160-5682
DOI: 10.2307/823025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Least cost heuristic for the delay-const

Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem

✍ Yong-Jin Lee; M. Atiquzzaman 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Heuristics for the multi-level capacitat

Heuristics for the multi-level capacitated minimum spanning tree problem

✍ Christos A. Pappas, Angelos-Christos G. Anadiotis… 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 180 KB

A hybrid heuristic for the diameter cons

A hybrid heuristic for the diameter constrained minimum spanning tree problem

✍ Abilio Lucena; Celso C. Ribeiro; Andréa C. Santos 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 363 KB

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 hierarchy of hop-indexed models for th

A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem

✍ Gouveia, Luis; Martins, Pedro 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 2 views

The Capacitated Minimum Spanning Tree Problem (CMSTP) is to find a minimum spanning tree subject to an additional constraint stating that the number of nodes in each subtree pending from a given root node is not greater than a given number Q. Gouveia and Martins (1996) proposed a hop-indexed flow mo

A Memory Adaptive Reasoning Technique fo

A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem

✍ R. Patterson; H. Pirkul; E. Rolland 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 108 KB