Hybrid

Improved Packing and Routing of Vehicles with Compartments
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia and others), pages 302-304, 2011.
PDF Cite
Tackling the Loading Aspect of the Vehicle Routing Problem with Compartments
Proceedings of the 9th Metaheuristics International Conference (Luca Di~Gaspero and Andrea Schaerf and Thomas Stützle), pages 679-681, 2011.
PDF Cite
A Timeslot-Based Heuristic Approach to Construct High-School Timetables
December 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and B.~Melian
PDF Cite
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
PDF Cite
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
PDF Cite
A Brief Survey on Hybrid Metaheuristics
Proceedings of BIOMA 2010 – 4th International Conference on Bioinspired Optimization Methods and their Applications (B. Filipic and J. Silc), pages 3-16, 2010.
PDF Cite
A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents
Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 (M. J. Blesa and others), volume 6373 of LNCS, pages 103-117, 2010, Springer.
PDF Cite
Matheuristics for the Periodic Vehicle Routing Problem with Time Windows
Proceedings of Matheuristics 2010: Third International Workshop on Model-Based Metaheuristics, pages 83-95, 2010.
PDF Cite
Metaheuristic Hybrids
Chapter in Handbook of Metaheuristics (Michel Gendreau and Jean Yves Potvin), volume 146 of International Series in Operations Research & Management Science, pages 469-496, 2010, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-08a.pdf
Cite
Strong Lower Bounds for a Survivable Network Design Problem
ISCO 2010 – International Symposium on Combinatorial Optimization (M. Haouari and A. R. Mahjoub), volume 36 of Electronic Notes in Discrete Mathematics, pages 295-302, 2010, Elsevier.
PDF Cite