Hybrid

Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie und kundenspezifischen Auslagerpr\f̈erenzen

Ulrike Ritzinger

Hybrid Metaheuristics for Generalized Network Design Problems

Parallel Variable Neighborhood Search for the Car Sequencing Problem

Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen

A Complete Archive Genetic Algorithm for the Multidimensional Knapsack Problem

Stephan Zaubzer

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 Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem

Sandro Pirkwieser, Günther Raidl, Jakob Puchinger

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

Günther Raidl, Martin Gruber

An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem

Matthias Prandtstetter, Günther Raidl