Module Handbook

  • Dynamischer Default-Fachbereich geändert auf MAT

Course MAT-51-12-K-7

Network and Discrete Location Theory (4V+2U, 9.0 LP)

Course Type

SWS Type Course Form CP (Effort) Presence-Time / Self-Study
- K Lecture with exercise classes (V/U) 9.0 CP 186 h
4 V Lecture 56 h
2 U Exercise class (in small groups) 28 h
(4V+2U) 9.0 CP 84 h 186 h


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


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.


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


Further literature will be announced in the lecture; Exercise material is provided.


Registration for the exercise classes via the online administration system URM (

References to Course [MAT-51-12-K-7]

Module Name Context
[MAT-51-12-M-7] Network and Discrete Location Theory P: Obligatory 4V+2U, 9.0 LP