Netdesign

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

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

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

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

Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem

Sandro Pirkwieser, Günther Raidl, Jakob Puchinger

Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem

Andreas Chwatal, Günther Raidl, Olivia Dietzel

Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem

Günther Raidl, Andreas Chwatal

Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem

Markus Leitner, Bin Hu, Günther Raidl

Cluster Planarity Testing for the Case of Not Necessarily Connected Clusters

A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem

Sandro Pirkwieser

An Ant Colony Optimisation Algorithm for the Bounded Diameter Minimum Spanning Tree Problem

Boris Kopinitsch

Biased Mutation Operators for Subgraph-Selection Problems

Günther Raidl, Gabriele Koller, Bryant A. Julstrom