✦ LIBER ✦

Genetic algorithm approach on multi-criteria minimum spanning tree problem

✍ Scribed by Gengui Zhou; Mitsuo Gen

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 252 KB
Volume: 114
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(98)00016-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A GRASP algorithm for the multi-criteria

A GRASP algorithm for the multi-criteria minimum spanning tree problem

✍ José Elias Claudio Arroyo; Pedro Sampaio Vieira; Dalessandro Soares Vianna 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 278 KB

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

Topology aggregation and decoding algori

Topology aggregation and decoding algorithms based on a minimum spanning tree in asymmetric multi-domain optical networks

✍ Jianping Wang; Chaoping Pan; Huai Zhang; Qiwu Wu; Xianwei Zhou 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 477 KB

A note on “Nonlinear fixed charge transp

A note on “Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm” by Jung-Bok Jo, Yinzhen Li, Mitsuo Gen, Computers & Industrial Engineering (2007)

✍ Fanrong Xie; Renan Jia 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 137 KB