Stefan Weltge

Prof. Dr. Stefan Weltge is a Professor of Discrete Mathematics at the Department of Mathematics, Technical University of Munich (TUM). He holds a PhD in Mathematics from Otto von Guericke University Magdeburg (2016) and was a postdoctoral researcher at ETH Zurich. His research focuses on combinatorial optimization, integer programming, and polyhedral combinatorics, with notable contributions to extension complexity and mixed-integer programming. He has received multiple teaching awards at TUM, including the TUM Supervisory Award (2022) and Best Lecturer recognitions in 2019 and 2021/22. His work has been published in leading journals such as the Journal of the ACM and Journal of Combinatorial Theory B.

Prof. Weltge’s academic contributions include groundbreaking research on the complexity of mixed-integer programs, polyhedral representations, and combinatorial optimization problems. He has organized conferences like OR 2024 and the Cargese Workshops on Combinatorial Optimization, and serves on program committees for IPCO, MIP, and ISCO. His research is supported by DFG grants, including the Individual Grant (NextGen) and the AdONE PhD Program. He advises PhD students working on topics such as integer programming, algorithm design, and optimization theory.

His publications span theoretical advancements in convex optimization, linear programming relaxations, and applications in logistics and operations research. Notable articles include work on bounded subdeterminants in integer programs and the complexity of stable set problems. His research bridges discrete mathematics with practical algorithmic solutions, influencing both theoretical and applied domains.