Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges

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

Abstract

Full Citation:

B. A. Julstrom, G. R. Raidl. Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges. Proceedings of the 2002 ACM Symposium on Applied Computing (G. Lamont and others), pages 547-552, 2002, ACM Press.

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

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