Nikolaus Frohner

contact | research | short cv | teaching | publications | talks | open source

Research Interests

• Decision Diagrams in Discrete Optimization
• Dynamic and Stochastic Vehicle Routing
• Sports League Scheduling

Short CV

• since 02/2018: PhD student supervised by Günther Raidl
• 2015-2017: Master studies of computer science at the TU Wien
• 2010-2015: Systems development in the field of telecommunications
• 2005-2010: Bachelor studies of computer science and physics at the TU Wien

Teaching

Summer Term 2021

• Lecture and Exercise Algorithms and Data Structures
• Seminar on Algorithms
• Seminar Wissenschaftliches Arbeiten

Winter Term 2020/21

• Lecture and Exercise Heuristic Optimization Techniques
• Seminar on Algorithms
• Seminar Wissenschaftliches Arbeiten

Publications

10 results

2023
[10]	Advancing State Space Search for Static and Dynamic Optimization by Parallelization and Learning Nikolaus Frohner May 2023, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by G. R. Raidl [bibtex] [pdf]
2021
[9]	Driver Shift Planning for an Online Store with Short Delivery Times Matthias Horn, Nikolaus Frohner, Günther R. Raidl Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020), volume 180 of Procedia Computer Science, pages 517–524, 2021. [bibtex] [pdf] [doi]
[8]	Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines Nikolaus Frohner, Matthias Horn, Günther R. Raidl Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020), volume 180 of Procedia Computer Science, pages 366-370, 2021. [bibtex] [pdf] [doi]
[7]	Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems Adrian Bracher, Nikolaus Frohner, Günther R. Raidl 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21) (Peter J. Stuckey, ed.), volume 12735 of LNCS, pages 283–298, 2021, Springer. [bibtex] [pdf] [doi]
2020
[6]	A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility Nikolaus Frohner, Günther R. Raidl Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2020: Volume I (Patrick De Causmaecker, Ender Özcan, Greet Vanden Berghe, eds.), 2020. [bibtex] [pdf]
[5]	A Beam Search Approach to the Traveling Tournament Problem Nikolaus Frohner, Bernhard Neumann, Günther R. Raidl Evolutionary Computation in Combinatorial Optimization – 20th European Conference, EvoCOP 2020 (Luís Paquete, Christine Zarges, eds.), volume 12102 of LNCS, pages 67–82, 2020, Springer. [bibtex] [pdf]
[4]	Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers Nikolaus Frohner, Günther R. Raidl Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019 (Giuseppe Nicosia, Panos Pardalos, Renato Umeton, Giovanni Giuffrida, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 445–457, 2020, Springer. [bibtex] [pdf]
[3]	Casual Employee Scheduling with Constraint Programming and Metaheuristics Nikolaus Frohner, Stephan Teuschl, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of LNCS, pages 279–287, 2020, Springer. [bibtex] [pdf]
2019
[2]	Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization Nikolaus Frohner, Stephan Teuschl, Günther R. Raidl Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia, others, eds.), pages 78–79, 2019. [bibtex] [pdf]
[1]	Towards Improving Merging Heuristics for Binary Decision Diagrams Nikolaus Frohner, Günther R. Raidl Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis, Yannis Marinakis, Panos Pardalos, eds.), volume 11968 of LNCS, pages 30–45, 2019, Springer. [bibtex] [pdf]

Talks

Approaching the Traveling Tournament Problem with Randomized Beam Search
CPAIOR 2020, online, September 24, 2020
[YouTube]

A Beam Search Approach to the Traveling Tournament Problem
EvoCOP 2020, Held as Part of EvoStar 2020, online, April 17, 2020
[Slides]

Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers
LOD 2019, Certosa di Pontignano, Siena, Tuscany, Italy, September 11, 2019
[Slides]

Towards Improving Merging Heuristics for Binary Decision Diagrams
LION 13, Chania, Crete, Greece, May 30, 2019
[Slides]

Casual Employee Scheduling with Constraint Programming, Ant Colony Opt., and Variable Neighborhood Descent
EUROCAST 2019, Las Palmas de Gran Canaria, Spain, February 18, 2019
[Slides]

Open Source

• TTP Beam Search Solver written in Julia and Python (related to [5])
• Instances for the Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility (related to [6])