Netdesign

Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problems
September 2003, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl
PDF bib
Hybrid Evolutionary Algorithms for Combinatorial Optimization
March 2003, Habilitation thesis at the Vienna University of Technology.
PDF bib
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs
Journal of Heuristics, volume 9, pages 401-427, 2003, Kluwer Academic Publishers.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/ljubic-02.pdf
bib
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
PDF bib
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 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
Proceedings of the 2003 ACM Symposium on Applied Computing (G. Lamont and others), pages 747-752, 2003, ACM Press.
PDF bib
A Memetic Algorithm for Vertex-Biconnectivity Augmentation
Applications of Evolutionary Computing: EvoWorkshops 2002 (S. Cagnoni and others), volume 2279 of LNCS, pages 102-111, 2002, Springer.
PDF bib
Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem
Information Processing Letters, volume 82, number 1, pages 39-45, 2002.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-02.pdf
bib
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.
PDF bib
On Weight-Biased Mutation for Graph Problems
Parallel Problem Solving from Nature – PPSN VII (J. J. Merelo Guervos and P. Adamidis and H.-G. Beyer and J.-L. Fern'andez-Villaca~nas and H.-P. Schwefel), volume 2439 of LNCS, pages 204-213, 2002.
PDF bib