Université de Magdeburg
Date(s) : 09/12/2022 iCal
17 h 00 min - 18 h 30 min
Bounding the combinatorial diameter of a polytope is a well-known and long-standing open problem. The great theoretical and practical interest in this question originates from the desire to efficiently solve linear programming. In this regard, since the ultimate goal is to optimize over polytopes, it is well worth looking at extended formulations as well. In this talk we will discuss polytope extensions having surprisingly small combinatorial diameter.
FRUMAM, St Charles (2ème étage)