People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Evolcomp
A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows
Sandro Pirkwieser
,
Günther Raidl
PDF
Cite
Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees
Sandro Pirkwieser
,
Ruben Ruiz-Torrubiano
,
Günther Raidl
PDF
Cite
Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms
Sandro Pirkwieser
,
Günther Raidl
PDF
Cite
Algorithmic Approaches to the String Barcoding Problem
Philipp Neuner
PDF
Cite
Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks
Thomas Bucsics
PDF
Cite
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
Sandro Pirkwieser
,
Günther Raidl
,
Jakob Puchinger
PDF
Cite
Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem
Andreas Chwatal
,
Günther Raidl
,
Olivia Dietzel
PDF
Cite
Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem
Günther Raidl
,
Andreas Chwatal
PDF
Cite
Models and Algorithms for Three-Stage Two-Dimensional Bin Packing
Jakob Puchinger
,
Günther Raidl
Cite
A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem
Sandro Pirkwieser
PDF
Cite
«
»
Cite
×