PhD courses

Syllabus 2017

All courses requires some knowledge of Graph Theory. Students without such knowledge are urged to read slides 1-11 of Problems on Graphs

Approximate solution of optimization problems



In addition to elements of Graph Theory, the course Matching and Assignment requires some knowledge of Linear programming and Computational Complexity. Students without such knowledge are urged to read slides 1-18 and 23-25 of Fundamentals from Operations Research

Matching and Assignment Part 1 (Corrected exercise, reload)

Matching and Assignment Part 2

Matching and Assignment Part 3

Matching and Assignment Part 4

The course requires some knowledge of Graph Theory and Linear Programming. If needed, students might benefit from reading Chapters 2 (slides 1-18) and 3 in Network Optimization



It is strongly recommended to print the slides. LAPTOPS, SMART/CELL PHONES, etc must be switched off during lectures.