Profile picture
Administrative data

Friedrich Eisenbrand

friedrich.eisenbrand@epfl.ch

EPFL SB MATH DISOPT
MA C1 553 (Bâtiment MA)
Station 8
1015 Lausanne

Expertise

Combinatorial Optimization, Algorithms and Complexity

Current work

Algorithms and complexity for Real Time Scheduling Mixed integer programming over TU systems Complexity of variants of Diophantine Approximation Combinatorial Geometry Friedrich Eisenbrand's research is supported by the Swiss National Science Foundation.
Friedrich Eisenbrand's main research interests lie in the field of discrete optimization, in particular in algorithms and complexity, integer programming, geometry of numbers, and applied optimization. He is best known for his work on efficient algorithms for integer programming in fixed dimension and the theory of cutting planes, which are an important tool to solve large scale industrial optimization problems in practice. Before joining EPFL in March 2008, Friedrich Eisenbrand was a full professor of mathematics at the University of Paderborn. Friedrich received the Heinz Maier-Leibnitz award of the German Research Foundation (DFG) in 2004 and the Otto Hahn medal of the Max Planck Society in 2001.

Infoscience

Teaching & PhD

PhD Students

Neta Singer, Ruben Manuel Skorupinski, Lukas Vogl, Jiaye Wei

Past EPFL PhD Students

Manuel Francesco Aprile (2018), Adrian Aloysius Bock (2014), Alfonso Bolívar Cevallos Manzano (2016), Jana Tabea Cslovjecsek (2023), Nicolai Hähnle (2012), Christoph Hunkenschröder (2020), Igor Malinovic (2019), Carsten Moldenhauer (2014), Martin Niemeier (2012), Thomas Rothvoss (2009), Moritz Andreas Venzin (2023)

Past EPFL PhD Students as codirector

Puck van Gerwen (2024)

Courses

Advanced linear algebra II - diagonalization

MATH-115(a)

The purpose of the course is to introduce the basic notions of linear algebra and to prove rigorously the main results of the subject.

Discrete optimization

MATH-261

This course is an introduction to linear and discrete optimization. Warning: This is a mathematics course! While much of the course will be algorithmic in nature, you will still need to be able to prove theorems.