B. A. Julstrom

Recent Publications

A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
B. A. Julstrom, Günther Raidl
in 2003 Genetic and Evolutionary Computation Conference’s Workshops Proceedings, Workshop on Analysis and Design of Representations (A. Barry and F. Rothlauf and D. Thierens and others), pages 2-7, 2003.
Note: best paper award winner of the workshop
PDF bib
Edge-Sets: An Effective Evolutionary Coding of Spanning Trees
Günther Raidl, B. A. Julstrom
IEEE Transactions on Evolutionary Computation, volume 7, number 3, pages 225-239, 2003.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-01.pdf
bib
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Günther Raidl, B. A. Julstrom
Proceedings of the 2003 ACM Symposium on Applied Computing (G. Lamont and others), pages 747-752, 2003, ACM Press.
PDF bib
Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges
B. A. Julstrom, Günther Raidl
Proceedings of the 2002 ACM Symposium on Applied Computing (G. Lamont and others), pages 547-552, 2002, ACM Press.
PDF bib
Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search
J. Gottlieb, B. A. Julstrom, F. Rothlauf, Günther Raidl
Proceedings of the 2001 Genetic and Evolutionary Computation Conference (L. Spector and others), pages 343-350, 2001, Morgan Kaufmann.
PDF bib