Hybrid

The Multidimensional Knapsack Problem: Structure and Algorithms
INFORMS Journal on Computing, volume 22, number 2, pages 250-265, 2010.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/puchinger-07.pdf
Cite
Variable Neighborhood Search Coupled with ILP-based Large Neighborhood Searches for the (Periodic) Location-Routing Problem
Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 (M. J. Blesa and others), volume 6373 of LNCS, pages 174-189, 2010, Springer.
PDF Cite
Hybrid Optimization Methods for Warehouse Logistics and the Reconstruction of Destroyed Paper Documents
December 2009, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl
PDF Cite
Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenfindung in einem Ersatzteillager mit domänenspezifischen Nebenbedingungen
April 2009, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M.~Prandtstetter
PDF Cite
Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing
April 2009, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M.~Ruthmair
PDF Cite
(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo and T. Stützle and S. Voss), volume 10 of Annals of Information Systems, pages 209-230, 2009, Springer.
PDF Cite
A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows
Proceedings of the International Network Optimization Conference 2009 (Maria Grazia Scutellà and others), 2009.
PDF Cite
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2009 (Carlos Cotta and Peter Cowling), volume 5482 of LNCS, pages 25-36, 2009, Springer.
PDF Cite
A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location
Proceedings of the 8th Metaheuristics International Conference (Stefan Voss and Marco Caserta), 2009.
PDF Cite
Boosting a Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows by ILP Techniques
Proceedings of the 8th Metaheuristic International Conference (Stefan Voss and Marco Caserta), 2009.
PDF Cite