PROBABILISTIC
MODELS
IN COMBINATORIAL OPTIMIZATION
Programme
Monday
09.00-11.00 Probability theory
11.00-13.00 Probability theory
15.00-17.00 Probability theory
17.00-19.00 Probability theory
Tuesday
09.00-11.00 Randomized algorithms for matching
11.00-13.00 Counting problems in general
15.00-17.00 Markov processes
17.00-19.00 Markov chains
Wednesday
09.00-11.00 Counting for knapsack
11.00-13.00 Mixing Markov chains
15.00-17.00 Counting monomer-dimer configurations
17.00-19.00 Applications to matching and permanents
Thursday
09.00-11.00 Primal-dual methods in general
11.00-13.00 Semidefinite programming and primal-dual methods
15.00-17.00 Semidefinite programming for max-cut
17.00-19.00 Semidefinite programming for coloring