People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Netdesign
Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation
Andreas M. Chwatal
,
Nina Musil
,
Günther Raidl
PDF
Cite
Event Based Similarity Search and its Applications in Business Analytics
Martin Suntinger
PDF
Cite
Similarity Searching in Complex Business Events and Sequences thereof
Hannes Obweger
PDF
Cite
Enhancing a Genetic Algorithm by a Complete Solution Archive Based on a Trie Data Structure
Andrej Sramko
PDF
Cite
(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
Martin Gruber
,
Günther Raidl
PDF
Cite
A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows
Sandro Pirkwieser
,
Günther Raidl
PDF
Cite
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Mario Ruthmair
,
Günther Raidl
PDF
Cite
A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location
Markus Leitner
,
Günther Raidl
PDF
Cite
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Bin Hu
,
Günther Raidl
PDF
Cite
Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem
Martin~Gruber
,
Günther Raidl
PDF
Cite
«
»
Cite
×