We assume basic knowledge of algorithms, linear algebra and graph theory at the bachelor level,  as covered for example in "Appendix VIII: Mathematical Background" in the book "Introduction to Algorithms" by Cormen, Leiserson, Rivest, and Stein. We further assume basic knowledge on linear programming, including duality, basic feasible solutions, and the simplex algorithm as discussed, e.g., in Chapter I.2 of the book "Integer and Combinatorial Optimziation" by Nemhauser and Wolsey.

Aim of the course

* Develop both theoretical understanding and practical skills in designing, analysing, and implementing algorithms for a wide range of discrete optimisation problems. 

*Gain exposure to current research directions in the field.

Rules about Homework/Exam

Every session will be accompanied by an exercise sheet to practice the material discussed in class. There will be no graded homework though. The grade is thus fully determined by the final exam.

Lecture notes/Literature

*Relevant research articles and other relevant material will be given during the course.