Netdesign

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
PDF bib
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
PDF bib Project
Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem
May 2009, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl
PDF bib
Accelerating Column Generation for a Survivable Network Design Problem
Proceedings of the International Network Optimization Conference 2009 (M. G. Scutell'a and others), April 2009.
PDF bib
Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing
April 2009, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M.~Ruthmair
PDF bib
Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation
International Network Optimization Conference 2009 (Maria Grazia Scutell`a and others), April 2009.
PDF bib
Event Based Similarity Search and its Applications in Business Analytics
March 2009, Master’s thesis, Vienna University of Technology, Institute of Computer Graphic s and Algorithms.
Note: supervised by G.~Raidl
PDF bib
Similarity Searching in Complex Business Events and Sequences thereof
March 2009, Master’s thesis, Vienna University of Technology, Institute of Computer Graphic s and Algorithms.
Note: supervised by G.~Raidl
PDF bib
Enhancing a Genetic Algorithm by a Complete Solution Archive Based on a Trie Data Structure
February 2009, Master’s thesis, Vienna University of Technology, Institute of Computer Graphic s and Algorithms.
Note: supervised by G.~Raidl
PDF bib
(Meta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo and T. Stützle and S. Voss), volume 10 of Annals of Information Systems, pages 209-230, 2009, Springer.
PDF bib