Lukas Brandl

Lukas Brandl is a Research Fellow at the Department of Operations Research, Technische Universität München (TUM). His research focuses on theoretical and computational aspects of optimization, specifically Linear Programming, Integer Programming, and Decision Diagrams for Optimization.

Education:

• B.Sc. Mathematics (2017–2020), TUM
• M.Sc. Mathematics (2020–2022), TUM
• PhD Mathematics (2022–present), TUM

Research Interests:

Brandl's work addresses problems in Combinatorial Optimization and Complexity Theory, with an emphasis on decision diagrams and polyhedral methods in optimization. His research explores both fundamental theory and practical applications of linear and integer programming.

Selected Publications:

• Brandl, Lukas; Schulz, Andreas S. (2024). Primal Separation and Approximation for the {0,1/2}-closure. Operations Research Letters.
• Brandl, Lukas; Schulz, Andreas S. (2023). Primal Separation and Approximation for the {0, 1/2}-closure. CoRR.

Teaching: In Summer Term 2023, he served as a Teaching Assistant for Applied Discrete Optimization.