Matthias Prandtstetter | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/matthias-prandtstetter/Matthias PrandtstetterHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngMatthias Prandtstetterhttps://ac.tuwien.ac.at/team/matthias-prandtstetter/Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problemhttps://ac.tuwien.ac.at/publication/metaheuristics-for-solving-a-multimodal-home-healthcare-scheduling-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristics-for-solving-a-multimodal-home-healthcare-scheduling-problem/Hybrid Heuristics for Multimodal Homecare Schedulinghttps://ac.tuwien.ac.at/publication/hybrid-heuristics-for-multimodal-homecare-scheduling/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-heuristics-for-multimodal-homecare-scheduling/A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documentshttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-reconstructing-cross-cut-shredded-text-documents/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-reconstructing-cross-cut-shredded-text-documents/Hybrid Optimization Methods for Warehouse Logistics and the Reconstruction of Destroyed Paper Documentshttps://ac.tuwien.ac.at/publication/hybrid-optimization-methods-for-warehouse-logistics-and-the-reconstruction-of-destroyed-paper-documents/Tue, 01 Dec 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-optimization-methods-for-warehouse-logistics-and-the-reconstruction-of-destroyed-paper-documents/A Hybrid Algorithm for Computing Tours in a Spare Parts Warehousehttps://ac.tuwien.ac.at/publication/a-hybrid-algorithm-for-computing-tours-in-a-spare-parts-warehouse/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-hybrid-algorithm-for-computing-tours-in-a-spare-parts-warehouse/Computing Optimized Stock (Re-)Placements in Last-In, First-Out Warehouseshttps://ac.tuwien.ac.at/publication/computing-optimized-stock-re-placements-in-last-in-first-out-warehouses/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-optimized-stock-re-placements-in-last-in-first-out-warehouses/Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documentshttps://ac.tuwien.ac.at/publication/meta-heuristics-for-reconstructing-cross-cut-shredded-text-documents/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-heuristics-for-reconstructing-cross-cut-shredded-text-documents/An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problemhttps://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem-2/Combining Forces to Reconstruct Strip Shredded Text Documentshttps://ac.tuwien.ac.at/publication/combining-forces-to-reconstruct-strip-shredded-text-documents/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-forces-to-reconstruct-strip-shredded-text-documents/Exact and Heuristic Methods for Solving the Car Sequencing Problemhttps://ac.tuwien.ac.at/publication/exact-and-heuristic-methods-for-solving-the-car-sequencing-problem/Mon, 01 Aug 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-and-heuristic-methods-for-solving-the-car-sequencing-problem/A Variable Neighborhood Search Approach for Solving the Car Sequencing Problemhttps://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-solving-the-car-sequencing-problem/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-solving-the-car-sequencing-problem/An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problemhttps://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem/