Matthias Prandtstetter

Recent Publications

Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem
Central European Journal of Operations Research, volume 23, number 1, pages 89-113, 2015.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/hiermann-13.pdf
Hybrid Heuristics for Multimodal Homecare Scheduling
9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12) (Nicolas Beldiceanu and Narendra Jussien and Éric Pinson), pages 339-355, 2012, Springer.
A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents
Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 (M. J. Blesa and others), volume 6373 of LNCS, pages 103-117, 2010, Springer.
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
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.
Computing Optimized Stock (Re-)Placements in Last-In, First-Out Warehouses
Logistik Management: Systeme, Methoden, Integration (Stefan Voss and others), pages 279-298, 2009, Physica Verlag.
Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents
GECCO~2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (Günther R. Raidl and others), pages 349-356, 2009, ACM Press.
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/prandtstetter-05a.pdf
Combining Forces to Reconstruct Strip Shredded Text Documents
Hybrid Metaheuristics 2008 (M. J. Blesa and others), volume 5296 of LNCS, pages 175-189, 2008, Springer.
Exact and Heuristic Methods for Solving the Car Sequencing Problem
August 2005, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and B.~Hu
A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem
Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.
An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem
2005, Technical report TR 186-1-05-01, Institute of Computer Graphics and Algorithms, Vienna University of Technology.