Mip

Heuristic Methods for the Hop Constrained Survivable Network Design Problem

Branch-and-Price for the Steiner Tree Problem with Revenues, Budget and Hop Constraints

Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem

Markus Leitner, Mario Ruthmair, Günther Raidl

Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem

Markus Leitner, Mario Ruthmair, Günther Raidl

Branch-and-Cut-and-Price for Capacitated Connected Facility Location

Markus Leitner, Günther Raidl

Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints

Johannes Inführ, Günther Raidl

On Stabilized Branch-and-Price for Constrained Tree Problems

Markus Leitner, Mario Ruthmair, Günther Raidl

Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques

Andreas Chwatal, Günther Raidl

On the Minimum Label Spanning Tree Problem: Solution Methods and Applications

Andreas Chwatal

Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods