Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, December 06, 2005, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Andreas S. Schulz (MIT and ETH Zürich)
This question was published in the 1976 issue of American Mathematical Monthly. While an answer has been known since 1978, we will revisit this question to study the usefulness of linear programming relaxations. This study will lead to the definition of the rank of a polytope, which in turn gives rise to another question: what is the maximum rank of a 0/1-polytope? The ultimate answer is not known, and good upper bounds are relatively recent. If time permits, we shall sketch the proof for one of them.
Automatic MiSe System Software Version 1.4803M | admin login