𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constrained spanning tree algorithms for irregularly-shaped spatial clustering

✍ Scribed by Marcelo Azevedo Costa; Renato Martins Assunção; Martin Kulldorff

Book ID
113557747
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
371 KB
Volume
56
Category
Article
ISSN
0167-9473

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on genetic algorithms for degree-
A note on genetic algorithms for degree-constrained spanning tree problems
✍ Zhou, Gengui; Gen, Mitsuo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 2 views

The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to solve this problem because of its NP-hard complexity. In this paper, we present a new approach to solve this problem by using genetic algorithms and computational results to