Volker Kaibel (U Magdeburg)
Monday, February 18, 2019 - 15:30
An der Urania 17, 10787 Berlin
BMS Days
Berlin Mathematical School
Formulating problems via linear inequalities and projections is at the heart of the polyhedral combinatorics approach to combinatorial optimization. In his talk, Kaibel will present some examples for which this can be achieved with surprisingly few inequalities and will give an almost pictorial proof showing that for other problems exponentially many inequalities are required.

Volker Kaibel is a professor of mathematics and a Chair for Mathematical Optimization at the Otto von Guericke University Magdeburg. His scientific research focuses on discrete mathematics with a strong emphasis on optimization and geometry.
submitted by Fagel (fagel@math.tu-berlin.de)