Mip

Strong Lower Bounds for a Survivable Network Design Problem

Markus Leitner, Günther Raidl

The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search

Bin Hu, Markus Leitner, Günther Raidl

The Multidimensional Knapsack Problem: Structure and Algorithms

Jakob Puchinger, Günther Raidl, Ulrich Pferschy

Accelerating Column Generation for a Survivable Network Design Problem

Markus Leitner, Günther Raidl, Ulrich Pferschy

Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation

Andreas M. Chwatal, Nina Musil, Günther Raidl

(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther Raidl

A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location

Markus Leitner, Günther Raidl

Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location

Markus Leitner, Günther Raidl

Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows

Sandro Pirkwieser, Günther Raidl

Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search

Jakob Walla, Mario Ruthmair, Günther Raidl