Hybrid

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

Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem

Sandro Pirkwieser, Günther Raidl, Jakob Puchinger

Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem

Andreas Chwatal, Günther Raidl, Olivia Dietzel

Models and Algorithms for Three-Stage Two-Dimensional Bin Packing

Jakob Puchinger, Günther Raidl

Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem

Markus Leitner, Bin Hu, Günther Raidl

A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem

Sandro Pirkwieser

A Unified View on Hybrid Metaheuristics

Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems

Jakob Puchinger

The Core Concept for the Multidimensional Knapsack Problem

Jakob Puchinger, Günther Raidl, Ulrich Pferschy