People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Packing
The Core Concept for the Multidimensional Knapsack Problem
Jakob Puchinger
,
Günther Raidl
,
Ulrich Pferschy
PDF
Cite
An Extended Local Branching Framework and its Application to the Multidimensional Knapsack Problem
Daniel Lichtenberger
PDF
Cite
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem
Günther Raidl
,
Jens Gottlieb
PDF
Cite
Relaxation Guided Variable Neighborhood Search
Jakob Puchinger
,
Günther Raidl
PDF
Cite
An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective Approach for 2D Bin Packing
Jakob Puchinger
,
Günther Raidl
PDF
Cite
Solving a Real-World Glass Cutting Problem
Jakob Puchinger
,
Günther Raidl
,
Gabriele Koller
PDF
Cite
Verfahren zur Lösung eines Glasverschnittproblems
Jakob Puchinger
PDF
Cite
Letting Ants Labeling Point Features
M. Schreyer
,
Günther Raidl
PDF
Cite
The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search
Jens Gottlieb
,
Günther Raidl
PDF
Cite
A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem
Günther Raidl
PDF
Cite
«
»
Cite
×