Monday

08.30-09.30 Course presentation - Audience contact
09.30-10.30 Some examples of real problems
11.00-12.00 Examples of combinatorial models
12.00-13.00 Computational complexity
14.30-15.30 Linear programming
15.30-16.30 The simplex method
17.00-18.00 Duality in linear programming

Tuesday

08.30-09.30 Network flows
09.30-10.30 Max flow and shortest path
11.00-12.00 Algorithms for network problems
12.00-13.00 Examples
14.30-15.30 Column generation method
15.30-16.30 Examples
17.00-18.00 Dynamic programming

Wednesday

08.30-09.30 Integer linear programming
09.30-10.30 Lower bounds
11.00-12.00 Branch and bound
12.00-13.00 Examples
14.30-15.30 Lagrangean relaxation
15.30-16.30 The subgradient method
17.00-18.00 Examples

Thursday

08.30-09.30 Cutting plane algorithms
09.30-10.30 Polyhedral combinatorics
11.00-12.00 Examples
12.00-13.00 Branch-and-cut and branch-and-price
14.30-15.30 Chvátal-Gomory inequalities
15.30-16.30 Sequential convexification
17.00-18.00 Lift and project

Friday

08.30-09.30 The job shop problem
09.30-10.30 The vehicle routing problem
11.00-12.00 The crew scheduling problem
12.00-13.00 The crew scheduling problem
14.30-17.30 Conclusions and open problems