Module Number

INFO-4432 		Module Title

Discrete Optimization 		Lecture Type(s)

Lecture, Tutorial
ECTS 6
Work load
- Contact time
- Self study
Workload:
180 h
Class time:
60 h / 4 SWS
Self study:
120 h
Duration 1 Semester
Frequency In the summer semester
Language of instruction German and English
Type of Exam

Written exam (oral exam with a small number of participants), exercise points
can be included as bonus points in the exam evaluation
Content

Topics include basics of linear optimization, methods of linear optimization, especially simplex algorithm, basics of integer optimization, branch-and-bound, cutting planes, and selected examples of of combinatorial optimization
Objectives

The students know some important algorithms of linear, integer and combinatorial optimisation as well as the underlying theoretical methods. They are able to assess the methods with regard to their complexity. By formally correctly writing down the solutions and implementing the methods presented in the lecture, the students acquire necessary competences for their own scientific work.
Allocation of credits / grading
Type of Class
Status
SWS
Credits
Type of Exam
Exam duration
Evaluation
Calculation
of Module (%)
Lecture
V
o
3
4.5
wt
90
g
100
Tutorial
Ü
o
1
1.5
Prerequisite for participation There are no specific prerequisites.
Lecturer / Other Kaufmann
Literature

Nemhauser, Wolsey: Integer and Combinatorial Optimization, Wiley (1999)
Skript zur Vorlesung
Last offered ---
Planned for ---
Assigned Study Areas INFO-INFO, INFO-THEO, MEDI-APPL, MEDI-INFO, ML-CS