7

Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methods

August 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and A.~Chwatal

Karin Oberlechner

Automatic Generation of 2-AntWars Players with Genetic Programming

July 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl

Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem

July 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M.~Ruthmair

Martin Berlakovich

On the Minimum Label Spanning Tree Problem: Solution Methods and Applications

May 2010, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and U.~Pferschy

Andreas Chwatal

Reconstructing Cross-Cut Shredded Documents by means of Evolutionary Algorithms

May 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M.~Prandtstetter

Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods

May 2010, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and U.~Pferschy

Compressing Fingerprint Templates by Solving the k-Node Minimum Label Spanning Arborescence Problem by Branch-and-Price

February 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and A.~Chwatal

Corinna Th{ö}ni

Heuristic methods for solving two Generalized Network Problems

February 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and B.~Hu

Hybrid Optimization Methods for Warehouse Logistics and the Reconstruction of Destroyed Paper Documents

December 2009, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl

Matthias Prandtstetter

Ein Lösungsarchiv-unterstützter evolutionärer Algorithmus für das Generalized Minimum Spanning Tree-Problem

July 2009, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and B.~Hu