Each lecture will be conducted as two 1h30 sessions, with a 15min. break in between.
Slides will be available here after the lecture. Some of the powerpoint slides were made on a Mac, and may not be completely compatible with the versions on Windows. The animations in some of the PPTX files will not be visible in the PDFs.
| 29/03, 14:00 | Introduction (pdf) Shortest Paths (pptx)(pdf) |
Assignment 1 is given |
| 05/04, 14:00 | Graph algorithms Part 1 (pptx)(pdf) Part 2 (pptx)(pdf) |
|
| 07/04, 14:00 | Lab session 1 (pptx)(pdf) | Discuss assignment 1 |
| 26/04, 14:00 | Dynamic programming, part 1 (PPTX, PDF) |
Assignment 2 is given |
| 28/04, 14:00 | Lab session 2, Dynamic programming, part 2 (PPTX, PDF) |
Discuss assignment 2 |
| 03/05, 14:00 | Lecture 4 Part 0, Blackjack (PPTX, PDF) Part 1, P, NP, NP-Complete (PPTX, PDF) Part 2, Menger’s Theorem (PPTX, PDF) |
|
| 05/05, 14:00 | Approximate methods: local search (PPTX, PDF) |
|
| 10/05, 14:00 | Lecture 6 Part 1, Linear Programming ( PDF) Part 2, Mixed Integer Programming, Duality (PPTX, PDF) |
Assignment 3 is given |
| 12/05, 14:00 | Lab session 3 | Discuss assignment 3 |
| 24/05, 14:00 | Lecture 7 Constraint programming (PPTX, PDF) |
|
| 31/05, 14:00 | Lecture 8 Primal and dual formulations of maximum flow, Lagrangian dual, dual decomposition (on the white board) + sample exam questions |
|
| 07/06, 14:00 | Exam |
