Evolcomp

Combinatorial Optimization for the Compression of Biometric Templates
May 2008, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and A.~Chwatal
PDF bib
Lagrangian Relax-and-Cut and Hybrid methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problems
May 2008, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M. Gruber
PDF bib
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
Chapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (C. Cotta and J. van~Hemert), volume 153 of Studies in Computational Intelligence, pages 69-85, 2008, Springer.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/pirkwieser-07a.pdf
PDF bib
A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows
Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing (Caroline Prodhon and others), 2008.
PDF bib
Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees
BIRD'08, 2nd International Conference on Bioinformatics Research and Development, Poster Presentations (J. Küng and K. Schneider and R. Wagner), volume 26 of Schriftenreihe Informatik, pages 115-124, 2008, Trauner Verlag.
PDF bib
Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms
GECCO ‘08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (Maarten Keijzer and others), pages 323-330, 2008, ACM.
PDF bib
Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization
Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (Edmund Burke and others), 2008.
PDF bib
Algorithmic Approaches to the String Barcoding Problem
October 2007, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl
PDF bib
Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks
March 2007, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and D.~Wagner
PDF bib
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
2007, Technical report TR 186-1-07-03, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
PDF bib