Chair of Discrete Optimization
University of Bremen
Department of Mathematics and Computer Science
- Efficient algorithms
- Mathematical optimization
- Algorithmic game theory
- Design and analysis of optimization algorithms
- Approximation algorithms
- Optimization under uncertainty, especially with stochastic information
- Graph and network algorithms
- Routing and tour planning
- Assignment problems
- Fairness of solutions
- Process optimization
- Fair solutions for the use of shared resources
- Optimization of routing and route planning
- Potential analysis of software-supported decision-making for complex problems
Prof. Dr. Daniel Schmand
ZeTeM – Center for Industrial Mathematics
Daniel Schmand studied mathematics at the Technical University of Berlin. He then moved to the Research Area Operations Research and Management at the Faculty of Economics at RWTH Aachen University, where he received his doctorate in 2019 from the Faculty of Mathematics and Computer Science. In the same year, he joined the Algorithms and Complexity working group at Goethe University Frankfurt as a postdoctoral researcher. In 2021, Daniel Schmand was appointed junior professor (with tenure track) for Discrete Optimization at the University of Bremen, where he successfully completed his interim evaluation in November 2023.
Since 2022, Daniel Schmand has been a member of the steering committee of the Bremen Research Cluster for Dynamics in Logistics (LogDynamics).