(Multi-objective) combinatorial optimization, especially graph problems
Multi-objective linear programming
Computational Geometry
Integer programming methods
Graph theory, graph algorithms
Computational complexity
Publications
Refereed Conference Articles
An Experimental Study of ILP Formulations for the Longest Induced Path Problem (arXiv) Fritz Bökler, Markus Chimani, Mirko H. Wagner, and Tilo Wiedera,
ISCO 2020, accepted
The Stochastic Steiner Tree Problem on Partial k-Trees Fritz Bökler, Petra Mutzel, and Bernd Zey,
Proceedings of the Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS) 2012, NOVPRESS Brno, October 2012.
The Output-sensitive Complexity of the BUCO Problem Fritz Bökler, Matthias Ehrgott, José Rui Figueira, Andreia P. Guerreiro, Kathrin Klamroth, Britta Schulze, and Daniel Vanderpooten,
Dagstuhl Reports, June 2020.
Konfliktarme Trassenverläufe Frank Weichert, Daniel Bachmann, Fritz Bökler, Jakob Kopec, Kira Popp, and Björn Schwarze,
arcAktuell 4/2015, 2015.
Transparente Identifizierung und Bewertung von Höchstspannungstrassen mittels mehrkriterieller Optimierung Daniel Bachmann, Fritz Bökler, Mike Dokter, Jakob Kopec, Björn Schwarze, and Frank Weichert,
Energiewirtschaftliche Tagesfragen, September 2015.
2019 Doctoral Dissertation Award of the MCDM Society
Former Research Projects
BMWI Projekt: Stromnetzplanung
This interdisciplinary research and development project has the aim to investigate sustainable methods of evaluating and analyzing network topologies and power grid lines. A special focus will be made on multi-objective tools and optimization.
Teaching/Lehre
Summer 2020
Lecture: Algorithmic Multiobjective Optimization
Winter 2019/20
Lecture: Approximation Algorithms
Seminar: Algorithmic Concepts
Summer 2019
Lecture: Algorithmic Multiobjective Optimization
Winter 2018/19
Practice Project: McGyver – Visualizing Algorithms for Multiobjective Graph Problems
Summer 2018
Practice Project: McGyver – Visualizing Algorithms for Multiobjective Graph Problems
Supervised Bachelor/Master/Diploma-Theses
Performance Differences between Label Setting and Correcting Algorithms in Multi-Objective Shortest Path Problems
Levin Nemesch, Bachelor's Thesis, Osnabrück University, 2020.
Methoden zur Lösung des Mehrkriteriellen Kürzeste-Wege-Problems im Überblick
Maximilian Trögel, Bachelor’s Thesis, TU Dortmund, 2017.
Optimale Schrittweiten für einen Bikriteriellen Evolutionären Algorithmus mit S-Metrik-Selektion
Rosa Pink, Bachelor’s Thesis, TU Dortmund with Günter Rudolph, 2016.
Vergleich von Algorithmen zum Bestimmen von Minimalen Vektoren
Oliver Zietek, Bachelor’s Thesis, TU Dortmund, 2016.
Enumeration Complexity of Multicriteria Linear Optimization
Christopher Morris, Master’s Thesis, TU Dortmund, 2015.
Algorithms for Multicriteria Network Design Problems on Graphs of Bounded Treewidth
Stephan Schlagkamp, Master’s Thesis, TU Dortmund, 2013.
staff/boekler.txt · Last modified: June 29, 2020 (12:06) by boekler