Regular biography
Friedrich Eisenbrand is a Full Professor at the École Polytechnique Fédérale de Lausanne (EPFL), affiliated with the Department of Mathematics (MATH). His research focuses on discrete optimization, particularly algorithms and complexity, integer programming, geometry of numbers, and applied optimization. His work includes efficient algorithms for integer programming in fixed dimension and the theory of cutting planes, which are essential for solving large-scale industrial optimization problems. Eisenbrand is also involved in teaching and supervising PhD students at EPFL. His research is supported by the Swiss National Science Foundation.
Scholar-generated biography
Friedrich Eisenbrand is a researcher whose work focuses on computation and mathematics, particularly in the areas of integer programming, polyhedral combinatorics, and algorithmic complexity. His research explores the complexity of problems such as the clique and dominating set, as well as the theoretical foundations of integer programming, including proximity results, sub-determinants, and the Chvátal rank of polytopes. Eisenbrand's contributions include the development of faster algorithms for integer programs with block structure and the analysis of the diameter of polyhedra. His work also extends to real-time scheduling and max-sum diversification, highlighting his interdisciplinary approach to computational problems.