1

Effective Neighborhood Structures for the Generalized Traveling Salesman Problem

Bin Hu, Günther Raidl

Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees

Sandro Pirkwieser, Ruben Ruiz-Torrubiano, Günther Raidl

Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms

Sandro Pirkwieser, 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

Not So Easy Problems For Tree Decomposable Graphs (invited talk)

Parameterized Graph Editing with Chosen Vertex Degrees

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

Bin Hu, Günther Raidl

The Parameterized Complexity of Regular Subgraph Problems and Generalizations

Luke Mathieson, Stefan Szeider

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

Markus Leitner, Günther Raidl