1

Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation

Andreas M. Chwatal, Nina Musil, Günther Raidl

A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows

Sandro Pirkwieser, Günther Raidl

A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse

Matthias Prandtstetter, Günther Raidl, Thomas Misar

A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Mario Ruthmair, Günther Raidl

A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location

Markus Leitner, Günther Raidl

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

Bin Hu, Günther Raidl

Applications of Finite Duality to Locally Finite Varieties of BL-Algebras

Stefano Aguzzoli and Simone Bova and Vincenzo Marra

Better Polynomial Algorithms on Graphs of Bounded Rank-Width

Boosting a Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows by ILP Techniques

Sandro Pirkwieser, Günther Raidl

Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem

Martin~Gruber, Günther Raidl