Special Topics of Discrete Mathematics
Spezielle Kapitel der Diskreten Mathematik
8 CPirregularlyEN
Prerequisites
Recommended, as written
Knowledge of the content of the module • 12868: Algorithmische Diskrete Mathematik • 11101: Lineare Algebra und Analytische Geometrie I or of the modules • 11112: Mathematik IT-1 (Diskrete Mathematik) • 11113: Mathematik IT-2 (Lineare Algebra) • 12215: Theoretische Informatik
Contents
The lecture is read with changing main focuses, e.g.: • Integer Programming: formulations, relaxation, optimality and bounds, integer polyeders, complexity of integer problems, cutting-plane method, branch-and-bound method, Lagrange duality, column generation • Network Optimization: essential flow algorithms and their complexity, formulation of flows as LP, IP, path based formulations, special network flows, k-splittable flows, unsplittable flows, dynamic flows, approximation algorithms
Learning outcomes
After successfully completing the module, students have in-depth knowledge of structures and algorithms in discrete mathematics. They are able to understand, analyze and apply essential algorithms in discrete mathematics. In addition, they have the skill to think structurally, use abstraction and modelling.
Assessment
• Oral examination, 30-45 min.
Literature (1)
- Depending on the specific focus specific references will be provided during the first week of the course.
Remarks
• Study programme Mathematics M.Sc.: Compulsory elective module in complex „Analysis/Algebra/Combinatorics“ • Study programme Mathematik B.Sc.: Compulsory elective module in complex „Vertiefung“, in limited extend • Study programme Wirtschaftsmathematik B.Sc.: Compulsory elective module in complex „Vertiefung“, in limited extend • Study programme Informatik M.Sc.: Compulsory elective module in complex „Mathematik“ or in field of application „Mathematik“
Source: BTU's module description · retrieved 29 Sep 2026Original