Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
Netdesign
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2007
(Carlos Cotta and Jano van~Hemert), volume 4446 of
LNCS
, pages 176-187, 2007, Springer.
Sandro Pirkwieser
,
Günther Raidl
,
Jakob Puchinger
PDF
bib
Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem
Proceedings of MIC2007, the 7th Metaheuristics International Conference
, pages 105/1-3, 2007.
Andreas Chwatal
,
Günther Raidl
,
Olivia Dietzel
PDF
bib
Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem
Numerical Analysis and Applied Mathematics
(T. E. Simos), volume 936 of
AIP Conference Proceedings
, pages 444-447, 2007, American Institute of Physics.
Günther Raidl
,
Andreas Chwatal
PDF
bib
The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search
2007, Technical report TR 186-1-07-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
Bin Hu
,
Markus Leitner
,
Günther Raidl
PDF
bib
Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem
Proceedings of the International Network Optimization Conference 2007
(Bernard Fortz), pages 69/1-6, 2007.
Markus Leitner
,
Bin Hu
,
Günther Raidl
PDF
bib
Cluster Planarity Testing for the Case of Not Necessarily Connected Clusters
December 2006, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl, R. Weiskircher, and M. Percan
Robert Beibl
PDF
bib
A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem
October 2006, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and J.~Puchinger
Sandro Pirkwieser
PDF
bib
An Ant Colony Optimisation Algorithm for the Bounded Diameter Minimum Spanning Tree Problem
January 2006, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M.~Gruber
Boris Kopinitsch
PDF
bib
Biased Mutation Operators for Subgraph-Selection Problems
IEEE Transactions on Evolutionary Computation
, volume 10, number 2, pages 145-156, 2006, IEEE Press.
Note: previous technical report version at
https://www.ac.tuwien.ac.at/files/pub/raidl-05.pdf
Günther Raidl
,
Gabriele Koller
,
Bryant A. Julstrom
bib
Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem
2006, Technical report TR 186-1-06-01, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
Bin Hu
,
Markus Leitner
,
Günther Raidl
PDF
bib
«
»
bib
×