About News Team Teaching Research Impressum

Linear Optimization and Network Algorithms

German Title: Lineare Optimierung und Netzwerkalgorithmen
Cycle: Every fall term
Regular Courses: Business Mathematics B.Sc.
Workload: 9 CP (4 SWS)

Recommended Prerequisites: Knowledge in Linear Algebra (e.g. Linear Algebra I) and basic knowledge about algorithms

Content: Shortest paths, maximum flows, bipartite matchings, min-cost flows, foundations of convex optimisation, linear optimisation, foundations of complexity theory, Dynamic Programming

Learning Outcomes: Participants know and understand basic terms, models and methods from linear and network optimisation. They can formulate practical problems as either Linear/Integer Programs or network flow problems. They understand algorithms for linear and network flow research and are able to analyse those. Furthermore, participants are able to apply methods to determine the complexity of problems.

Exam Type: Oral or written examination
Exam Requirements: Solving and presentation of several excercises throughout the term