B. A. Julstrom

Recent Publications

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 and F. Rothlauf and D. Thierens and others), pages 2-7, 2003.
Note: best paper award winner of the workshop
Edge-Sets: An Effective Evolutionary Coding of Spanning Trees
IEEE Transactions on Evolutionary Computation, volume 7, number 3, pages 225-239, 2003.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-01.pdf
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Proceedings of the 2003 ACM Symposium on Applied Computing (G. Lamont and others), pages 747-752, 2003, ACM Press.
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.
Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search
Proceedings of the 2001 Genetic and Evolutionary Computation Conference (L. Spector and others), pages 343-350, 2001, Morgan Kaufmann.
Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problems
Proceedings of the 16th ACM Symposium on Applied Computing (G. Lamont and others), pages 321-326, 2001, ACM Press.