Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Unit
Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
The Discrete Optimization Chair at EPFL focuses on designing and analyzing algorithms for discrete optimization problems, such as routing information through networks and energy-efficient image display. Led by Professor Friedrich Eisenbrand, the chair contributes theoretical results and applies research to real-world problems. Members include PhD students and PostDocs working on polyhedral combinatorics, approximation algorithms, and combinatorial optimization. Research interests cover integer programming, geometry of numbers, and applied optimization. The chair offers courses on graph theory, diophantine approximation, and quantum algorithms, among others.