Discrete and Combinatorial Optimisation
Diskrete und Kombinatorische Optimierung
Cycle:
Summer
Language:
English
Credits:
9
Regular Courses:
-
Mathematics B.Sc.
-
Business Mathematics B.Sc.
Exam:
-
Exam Type:
Oral or Written
-
Exam Requirements:
Solving and presentation of several excercises throughout the term
Content
-
Minimum spanning tree
-
Matchings in general graphs
-
Foundations of approximation algorithms
-
Foundations of discrete optimisation
-
Foundations and algorithms of machine learning
Learning Targets
-
Deep understanding of terms, models and methods from linear and network optimisation
-
Understanding algorithms for linear and network flow research and ability to analyse those
-
Formulation of real world problems as abstract and well-known mathematical problems from discrete and combinatorial optimisation
Recommended Prerequisites
Knowledge of Linear Optimization and Network Algorithms
