Hybrid

Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen
September 2008, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M.~Prandtstetter
PDF bib
A Complete Archive Genetic Algorithm for the Multidimensional Knapsack Problem
May 2008, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl
PDF bib
Lagrangian Relax-and-Cut and Hybrid methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problems
May 2008, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M. Gruber
PDF bib
(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem
Proceedings of Matheuristics 2008: Second International Workshop on Model Based Metaheuristics (P. Hansen, others, eds.), 2008.
PDF bib
(Meta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
2008, Technical report TR 186–1–08–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
PDF bib
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
Chapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (C. Cotta, J. van~Hemert, eds.), volume 153 of Studies in Computational Intelligence, pages 69–85, 2008, Springer.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/pirkwieser-07a.pdf
PDF bib
A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
Numerical Analysis and Applied Mathematics (T. E. Simos, others, eds.), volume 1048 of AIP Conference Proceedings, pages 446–449, 2008, American Institute of Physics.
PDF bib
An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem
European Journal of Operational Research, volume 191, number 3, pages 1004–1022, 2008.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/prandtstetter-05a.pdf
PDF bib
Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search
Journal of Heuristics, volume 14, number 5, pages 457–472, 2008.
PDF bib
Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
Chapter in Hybrid Metaheuristics – An Emergent Approach for Combinatorial Optimization (C. Blum, M. J. Blesa Augilera, A. Roli, M. Sampels, eds.), volume 114 of Studies in Computational Intelligence, pages 31–62, 2008, Springer.
PDF bib