Messages

Exam room: 

Niels Henrik Abels hus: Undervisningsrom 919

(Dec. 12, from 11:00 to 15:00)

The exams will be entirely based on the contents of the slides posted in this page. 

More specifically, each individual exam will consist of:

1. A short exercise (approx. 15 minutes) 

2.  A few oral questions 

Final (oral) examination.

Date: December 12th

Time: 11:00 - 15:00.

The time is only a preliminary indication. 

In a few weeks we will give more details about how the exam will be carried out. 

Here you can find the slides on cuts and flows in digraphs, and graphical models. 

Here you can find the slides on more algorithms in learning. I removed the exercise on the barrier method, as we didn't have time to cover it in enough detail. If you want to implement the method still, look in Chapter 11.3 of the book by Boyd, Vandenberghe, which is available online.

Here you can find the slides on classification trees 

Here you can find the slides on algorithms for continuous optimization. 

Here you can find the slides on convexity, duality and optimization 

Here you can find the slides that covers the first two lessons on Combinatorial Optimization

The topic of the course will be on mathematical optimization and learning (see Course description for more details) and the course will run over 7 weeks starting on September 5 (see Schedule for more details).