People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Hybrid
Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search
Jakob Puchinger
,
Günther Raidl
PDF
Cite
Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
Günther Raidl
,
Jakob Puchinger
PDF
Cite
Combining Forces to Reconstruct Strip Shredded Text Documents
Matthias Prandtstetter
,
Günther Raidl
PDF
Cite
Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem
Bin Hu
,
Markus Leitner
,
Günther Raidl
PDF
Cite
Effective Neighborhood Structures for the Generalized Traveling Salesman Problem
Bin Hu
,
Günther Raidl
PDF
Cite
Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms
Sandro Pirkwieser
,
Günther Raidl
PDF
Cite
Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
Martin Gruber
,
Günther Raidl
PDF
Cite
Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks
Markus Leitner
,
Günther Raidl
PDF
Cite
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
Bin Hu
,
Günther Raidl
PDF
Cite
Algorithmic Approaches to the String Barcoding Problem
Philipp Neuner
PDF
Cite
«
»
Cite
×