A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem

B. A. Julstrom, Günther Raidl
January 2003
PDF bib

Abstract

Full Citation:

B. A. Julstrom, G. R. Raidl. A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. in 2003 Genetic and Evolutionary Computation Conference’s Workshops Proceedings, Workshop on Analysis and Design of Representations (A. Barry, F. Rothlauf, D. Thierens, others, eds.), pages 2–7, 2003. (Note: best paper award winner of the workshop)

Type
Conference Paper
Evolcomp Netdesign
Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.