Combinatorial Optimization

Hausdorff Trimester Program

September 1 - December 18, 2015

Organizers: András Frank, Satoru Iwata, Jochen Könemann, Jens Vygen

Combinatorial optimization is an active field leveraging ideas from many different areas including graph theory, combinatorics, matroid theory, submodularity, connectivity, network flows, approximation algorithms, mathematical programming, game theory, algebraic and geometric methods, and applications. This trimester program was intended to bring together the field's best researchers focusing on the discovery of new connections, and to establish new and deepen existing international collaborations.

We hosted long-term visitors and organized four workshops during the program, on the broad topics

• Connectivity, Routing, and Network Design (Sep 7-11);
• Rigidity, Submodularity, and Discrete Convexity (Oct 5-9);
• Relaxations and Polyhedral Methods (Nov 16-20);
• Algorithmic and Computational Game Theory (Dec 14-17).

A summer school on combinatorial optimization took place from September 21 to 25.