Netdesign

A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Günther Raidl, Martin Gruber

Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem

Bin Hu, Markus Leitner, Günther Raidl

Effective Neighborhood Structures for the Generalized Traveling Salesman Problem

Bin Hu, Günther Raidl

Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther Raidl

Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks

Markus Leitner, Günther Raidl

Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem

Bin Hu, Günther Raidl

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

Markus Leitner, Günther Raidl

Map-Matching und Wegsuche in einem geografischen Informationssystem

Andreas Braumann

Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded Diameter Minimum Spanning Tree Problem

Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks