Convex hulls of sets of 0/1-vectors (0/1-polytopes) form the backbone of Polyhedral Combinatorics. Over the last four decades, extensive research on special 0/1-plytopes has lead to tremendous improvements in the solution of combinatorial optimization problems. The goal of this project is to better understand the class of 0/1-polytopes. Our vision is to finally utilize general geometric and combinatorial insights for concrete combinatorial (optimization) problems.

• Rafael Gillmann (TU Berlin)
• Günter M. Ziegler (TU Berlin)