Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
7
Computational Methods for Fleet Scheduling in E-Mobility
August 2021, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
Johannes Varga
PDF
bib
Scheduling the Charging of Electric Vehicles with SOC-Dependent Maximum Charging Power
April 2021, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and T. Jatschka
Benjamin Schaden
PDF
bib
Randomized Construction Approaches to the Traveling Tournament Problem using Lower Bound Based Heuristics
March 2021, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and N. Frohner
Giulio Pace
PDF
bib
Casual Employee Scheduling with Constraint Programming and Metaheuristics
November 2020, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and N. Frohner
Stephan Teuschl
PDF
bib
Solving a Generalized Constrained Longest Common Subsequence Problem
June 2020, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and M. Djukanovic
Christoph Berger
PDF
bib
Combinatorial Optimization Approaches for Graph Construction Problems
April 2020, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by Günther~R.~Raidl
Benedikt Klocker
PDF
bib
Heuristische Optimierungsverfahren für die Koordinierung von Flughafenslots
March 2020, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and A. Chwatal
Simeon Kuran
PDF
bib
A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem
December 2019, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and M. Horn
Thomas Kaufmann
PDF
bib
Perfect Pseudo Matchings on Snarks
May 2019, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
Benjamin Schwendinger
PDF
bib
Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging
April 2019, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
Benedikt Klocker
PDF
bib
«
»
bib
×