Hybrid

A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem

2007, Technical report TR 186-1-07-03, Institute of Computer Graphics and Algorithms, Vienna University of Technology.

Sandro Pirkwieser, Günther Raidl, Jakob Puchinger

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

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

Models and Algorithms for Three-Stage Two-Dimensional Bin Packing

European Journal of Operational Research, volume 183, number 3, pages 1304-1327, 2007.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/puchinger-04b.pdf

Jakob Puchinger, Günther Raidl

The Multidimensional Knapsack Problem: Structure and Algorithms

2007, Technical report TR 186-1-07-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.

Jakob Puchinger, Günther Raidl, Ulrich Pferschy

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

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

A Unified View on Hybrid Metaheuristics

Proceedings of the Hybrid Metaheuristics Workshop (Francisco Almeida and others), volume 4030 of LNCS, pages 1-12, 2006, Springer.

Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search

2006, Technical report TR 186-1-06-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.

Jakob Puchinger, Günther Raidl

Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems

January 2006, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and U.~Pferschy

Jakob Puchinger