Module

Network Optimization

Netzwerkoptimierung

8 LPunregelmäßigEN

Voraussetzungen

Empfohlen, im Wortlaut

Knowledge of the contents of modules • 11101: Lineare Algebra und analytische Geometrie I • 12868: Algorithmische Diskrete Mathematik or of modules • 11112: Mathematik IT-1 (Diskrete Mathematik) • 11113: Mathematik IT-2 (Lineare Algebra)

Inhalte

• basic concepts of network optimization • shortest paths • network flow algorithms, network flows with minimum cost, k-splittable flows • time-dependent/dynamic network flows (flows over time) • maximum matching and weighted matching, matching algorithms • social responsibility of researchers in the context of network optimization

Lernziele

The students • know important terms, relationships and algorithms from the field of network optimization • are able to analyse and prove the correctness and runtime of the algorithms • are able to apply concepts from the field of network optimization to solve practical problems • have gained experience in independent scientific work using network optimization topics as examples.

Prüfungsleistung

Prerequisite: • Successful completion of homework (fortnightly) and successful completion of tests (approx. 4 tests of 15-30 minutes each, written during the lecture period) Final module examination: • Written examination, 90 min. OR • Oral examination, 30 min. During the first class meeting, notice will be given on how the prerequisite will be structured and whether the examination will be in written or oral form.

Literatur (3)
  • Korte, Vygen: Combinatorial Optimization – Theory and Algorithms, Springer
  • Cook, Cunningham, Pulleyblank, Schrijver: Combinatorial Optimization. Wiley.
  • Ahuja, Magnanti, Orlin: Network Flows: Theory and Applications, Prentice Hall

Bemerkungen

• study programme Mathematics M.Sc.: Compulsory elective module in the complex „Optimization” • study programme Mathematical Data Science M.Sc.: Compulsory elective module in the complex „Advanced Mathematical Methods in Data Science” • study programme Artificial Intelligence M.Sc.: Compulsory elective module in the complex „Knowledge Acquisition, Representation, and Processing” • study programme Angewandte Mathematik M.Sc.: Compulsory elective module in the complex „Optimierung” • study programme Mathematik B.Sc.: Compulsory elective module in the complex „Vertiefung”, in limited extend • study programme Wirtschaftsmathematik B.Sc.: Compulsory elective module in the complex „Vertiefung”, in limited extend • study programme Künstliche Intelligenz B.Sc.: Compulsory elective module in the complex „Wissensakquise, -repräsentation und -verarbeitung” • study programme Informatik M.Sc.: Compulsory elective module in the complex „Mathematik” or in field of application „Mathematik”

Quelle: Modulbeschreibung der BTU · abgerufen 29.09.2026Original

Modulkatalog · inoffiziell

Betula ist ein inoffizielles Projekt und gehört nicht zur BTU.

Folia 1.0.3Radix 0.6.0

Daten vom 21.10.2026WiSe 2026/27Quelle: BTU