Mip

Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates

Andreas M. Chwatal, Günther Raidl, Karin Oberlechner

Lagrangian Relax-and-Cut and Hybrid methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problems

Ferdinand Zaubzer

(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther Raidl

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

Günther Raidl, Martin Gruber

Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search

Jakob Puchinger, Günther Raidl

Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization

Günther Raidl, Jakob Puchinger

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

Bin Hu, Markus Leitner, Günther Raidl

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

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

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

Martin Gruber, Günther Raidl

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