Netdesign

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

Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem

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

Markus Leitner, Günther Raidl

Map-Matching und Wegsuche in einem geografischen Informationssystem

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

Andreas Braumann

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

A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks

Proceedings of the International Network Optimization Conference 2007 (Bernard Fortz), pages 103/1-6, 2007.

Daniel Wanger, Ulrich Pferschy, Petra Mutzel, Günther Raidl, P.Bachhiesl

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.

Sandro Pirkwieser, Günther Raidl, Jakob Puchinger

A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks

Operations Research Proceedings 2006 (Karl-Heinz Waldmann and Ulrike M. Stocker), 2007, Springer.

Daniel Wagner, Günther Raidl, Ulrich Pferschy, Petra Mutzel, Peter Bachhiesl