Module Handbook

  • Dynamischer Default-Fachbereich geändert auf MAT

Module MAT-51-12-M-7

Network and Discrete Location Theory (M, 9.0 LP)

Module Identification

Module Number Module Name CP (Effort)
MAT-51-12-M-7 Network and Discrete Location Theory 9.0 CP (270 h)

Basedata

CP, Effort 9.0 CP = 270 h
Position of the semester 1 Sem. irreg.
Level [7] Master (Advanced)
Language [EN] English
Module Manager
Lecturers
Area of study [MAT-OPT] Optimisation
Livecycle-State [NORM] Active

Courses

Type/SWS Course Number Title Choice in
Module-Part
Presence-Time /
Self-Study
SL SL is
required for exa.
PL CP Sem.
4V+2U MAT-51-12-K-7
Network and Discrete Location Theory
P 84 h 186 h - - PL1 9.0 irreg.
  • About [MAT-51-12-K-7]: Title: "Network and Discrete Location Theory"; Presence-Time: 84 h; Self-Study: 186 h

Examination achievement PL1

  • Form of examination: oral examination (20-30 Min.)
  • Examination Frequency: irregular (by arrangement)
  • Examination number: 86313 ("Network and Discrete Location Theory")

Evaluation of grades

The grade of the module examination is also the module grade.


Contents

The students learn the basics of network and discrete location theory. Current research topics, in which the students can play an active role, will be introduced in the last part of the course.

The following topics are treated:

  • interrelation between shortest paths and network location problems,
  • multicriteria network location problems,nteger programming formulations for discrete location problems,
  • complexity analysis for network and discrete location problems,
  • advanced location models and research topics.

Competencies / intended learning achievements

Upon successful completion of this module, the students have acquired a good overview on the established methods to solve network and discrete location problems. These problems are of particular importance for various applications in industry and society. The sudents have learned to critically evaluate the possibilities and limitations of algorithms. They have been introduced to current research topics.

By completing the given exercises, the students have developed a skilled, precise and independent handling of the terms, propositions and techniques taught in the lecture. Moreover, they have learnt how to apply these techniques to new problems, analyze them and develop solution strategies.

Literature

  • M. S. Daskin: Network and Discrete Location: Models, Algorithms, and Applications,
  • S. Nickel: Discrete and Network Location Theory.

References to Module / Module Number [MAT-51-12-M-7]

Module-Pool Name
[MAT-52-MPOOL-7] Specialisation Mathematical Optimisation (M.Sc.)
[MAT-AM-MPOOL-7] Applied Mathematics (Advanced Modules M.Sc.)