Netdesign

Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Mario Ruthmair, Andreas Hubmer, Günther Raidl

Variable Neighborhood Search for Capacitated Connected Facility Location

Markus Leitner, Günther Raidl

Ein neues Lösungsarchiv für das Generalized Minimum Spanning Tree-Problem

Mika Sonnleitner

Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methods

Karin Oberlechner

Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem

Martin Berlakovich

On the Minimum Label Spanning Tree Problem: Solution Methods and Applications

Andreas Chwatal

Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods

Compressing Fingerprint Templates by Solving the k-Node Minimum Label Spanning Arborescence Problem by Branch-and-Price

Heuristic methods for solving two Generalized Network Problems

A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem

Anna Pagacz, Bin Hu, Günther Raidl