People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Hybrid
Dynamische Reihenfolgeoptimierung mittels Simulation und Meta-Heuristiken
David Fischinger
Cite
Exact and Heuristic Methods for Solving the Car Sequencing Problem
Matthias Prandtstetter
PDF
Cite
An Extended Local Branching Framework and its Application to the Multidimensional Knapsack Problem
Daniel Lichtenberger
PDF
Cite
A New 0--1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem
Martin Gruber
,
Günther Raidl
PDF
Cite
A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem
Matthias Prandtstetter
,
Günther Raidl
PDF
Cite
Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification
Jakob Puchinger
,
Günther Raidl
PDF
Cite
Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search
Bin Hu
,
Markus Leitner
,
Günther Raidl
PDF
Cite
Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem
Jakob Puchinger
,
Günther Raidl
,
Martin Gruber
PDF
Cite
Relaxation Guided Variable Neighborhood Search
Jakob Puchinger
,
Günther Raidl
PDF
Cite
An Alignment Graph based Evolutionary Algorithm for the Multiple Sequence Alignment Problem
Stefan Leopold
PDF
Cite
«
»
Cite
×