Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
Evolcomp
A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables
Chapter in
Advances in Metaheuristics
(Luca Di~Gaspero and Andrea Schaerf and Thomas Stützle), volume 53 of
Operations Research/Computer Science Interfaces Series
, pages 143-158, 2013, Springer.
Michael Pimmer
,
Günther Raidl
PDF
Cite
Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archive
Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory
, pages 226-228, 2013.
Benjamin Biesinger
,
Christian Schauer
,
Bin Hu
,
Günther Raidl
PDF
Cite
Project
Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent
Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP~2013
(M. Middendorf and C. Blum), volume 7832 of
LNCS
, pages 250-261, 2013, Springer.
Johannes Inführ
,
Günther Raidl
PDF
Cite
Solving Multimodal Resource Constrained Project Scheduling Problems
September 2012, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl
Martin Sturm
PDF
Cite
Enhancing an Evolutionary Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents
May 2012, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and C.~Schauer and B.~Hu
Benjamin Biesinger
PDF
Cite
Project
Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportation
May 2012, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and K.~F.~Dörner
Sandro Pirkwieser
PDF
Cite
Metaheuristics for a Multimodal Home-Health Care Scheduling Problem
May 2012, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and J. Puchinger
Gerhard Hiermann
PDF
Cite
On Solving Constrained Tree Problems and an Adaptive Layers Framework
pages 187, May 2012, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and U.~Pferschy
Ruthmair, Mario
PDF
Cite
A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I
(R. Moreno-Díaz and others), volume 6927 of
LNCS
, pages 351-358, 2012, Springer.
Mario Ruthmair
,
Günther Raidl
PDF
Cite
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2012
(J.-K. Hao and M. Middendorf), volume 7245 of
LNCS
, pages 13-24, 2012, Springer, Heidelberg.
Martin Schwengerer
,
Sandro Pirkwieser
,
Günther Raidl
PDF
Cite
«
»
Cite
×