Hybrid

Combining Forces to Reconstruct Strip Shredded Text Documents

Hybrid Metaheuristics 2008 (M. J. Blesa and others), volume 5296 of LNCS, pages 175-189, 2008, Springer.

Matthias Prandtstetter, Günther Raidl

Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem

Journal of Heuristics, volume 14, number 5, pages 473-499, 2008.

Bin Hu, Markus Leitner, Günther Raidl

Effective Neighborhood Structures for the Generalized Traveling Salesman Problem

Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2008 (Jano van Hemert and Carlos Cotta), volume 4972 of LNCS, pages 36-47, 2008, Springer.
Note: best paper award winner

Bin Hu, Günther Raidl

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.

Sandro Pirkwieser, Günther Raidl

Heuristic Cut Separation in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, pages 261-264, 2008, IEEE Computer Society.

Martin Gruber, Günther Raidl

Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks

Hybrid Metaheuristics 2008 (M. J. Blesa and others), volume 5296 of LNCS, pages 158-174, 2008, Springer.

Markus Leitner, Günther Raidl

Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem

Proceedings of the 8th International Conference on Hybrid Intelligent Systems – HIS~2008 (Fatos Xhafa and others), pages 73-77, 2008.

Bin Hu, Günther Raidl

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

Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded Diameter Minimum Spanning Tree Problem

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

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