Netdesign

Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location

Markus Leitner, Günther Raidl

Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances

Martin Gruber, Günther Raidl

Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates

Andreas M. Chwatal, Günther Raidl, Karin Oberlechner

Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics

Martin~Gruber, Günther Raidl

Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierung

Hybrid Metaheuristics for Generalized Network Design Problems

Combinatorial Optimization for the Compression of Biometric Templates

Lagrangian Relax-and-Cut and Hybrid methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problems

Ferdinand Zaubzer

(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther Raidl

A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem

Sandro Pirkwieser, Günther Raidl, Jakob Puchinger