Credits: 5

Schedule: 07.01.2020 - 03.04.2020

Teaching Period (valid 01.08.2018-31.07.2020): 

Not lectured (2018-2019)

III-IV Spring (2019-2020) Only exam (2019-2020)

Lectured every other year.

Learning Outcomes (valid 01.08.2018-31.07.2020): 

Build skills in formulating integer optimisation models; a knowledge of the most important aspects for formulating efficient models; an understanding of the role of algorithmic thinking in the solution of integer optimisation problems and the ideas behind the most successful algorithms; competence in the use of computer packages for optimisation; familiarity with key technical terminology used in the specialised literature.

Content (valid 01.08.2018-31.07.2020): 

Modelling aspects of optimisation problems that include integer variables; the most successful algorithmic approaches: branch and bound and variants, cutting-plane methods, and heuristics; the role of duality in integer programming, Lagrangian relaxation, and decomposition methods.

Assessment Methods and Criteria (valid 01.08.2018-31.07.2020): 

Home assignments, presentation in seminar.

An exam.

Workload (valid 01.08.2018-31.07.2020): 

Contact hours 48h. Attendance is not compulsory

Home exercises 20h

Assignment 25h

Autonomous studies 132 h

Exam 3h

Study Material (valid 01.08.2018-31.07.2020): 

Materials and bibliography avaiable at course's homepage.

Details on the course materials (applies in this implementation): 

The material for preparing for exam is in MyCourses.

Substitutes for Courses (valid 01.08.2018-31.07.2020): 

Mat-2.4146 Integer Programming P, MS-E2146 Integer programming 

Course Homepage (valid 01.08.2018-31.07.2020):

Prerequisites (valid 01.08.2018-31.07.2020): 

MS-E2121 Linear Optimization

Grading Scale (valid 01.08.2018-31.07.2020): 



Registration and further information