The school will cover the following topics:
Program at a glance
Day/Time 
9.0011.00 
11.3013.30 
15.0017.00 

Monday 
PC1 
PC2 
IP1 
Tuesday 
IP2 
PC3 
IP3 
Wednesday 
IP4 
DW1 
IP5 
Thursday 
DW2 
SDP1 
PC4 
Friday 
PC5 
SDP2 

Every day:
11.0011.30
coffee break
13.3015.00
lunch
Polyhedral Combinatorics
by Santanu S. Dey
Polyhedral combinatorics is the branch of mathematics that deals with the study of polyhedra associated with integer vectors satisfying linear constraints. It has proven to be a powerful unifying methodology for tackling many combinatorial optimization problems. For example, it has lead to polynomialtime algorithms for many combinatorial optimization problems. Techniques based on polyhedral combinatorics have also been used to develop powerful computational tools withing modern mixedinteger programming solvers. In particular cuttingplane theory has revolutionized how mixedinteger programming problems are solved. This lecture series will cover the basics of polyhedral combinatorics with focus on mixedinteger programming theory.
Interior Point Methods
by Jordi Castro
Advanced DantzigWolfe Decomposition
by Antonio Frangioni
Semidefinite Programming
by Veronica Piccialli