Module Handbook

  • Dynamischer Default-Fachbereich geändert auf MAT

Course MAT-51-10-K-7

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
Area of study [MAT-OPT] Optimisation
Additional informations
Livecycle-State [NORM] Active


In the lecture and exercise classes, the fundamentals of network and discrete location theory as well as planar location theory are discussed. The last part of the module also presents current research topics that students could work on. The following contents will be covered in detail:
  • classification and formulations of location problems,
  • complexity results for location problems,
  • dealing with the fundamental concepts of location theory: finite dominating sets, location allocation, Weber problems,
  • optimality criteria depending on the structure of the class of location problem, in particular of the distance function,
  • exact, approximate and heuristic procedures for solving location problems,
  • extensions of location problems by considering several criteria,
  • discussion of current research directions, such as obnoxious location, dynamic models or combined location route planning.


  • G. Laporte, S. Nickel, F. Saldanha da Gama: Location Science,
  • M. S. Daskin: Network and Discrete Location: Models, Algorithms, and Applications,
  • R.L. Francis, F. McGinnis, J.A. White: Facility Layout and Location,
  • H. Hamacher: Mathematische Lösungsverfahren für planare Standortprobleme,
  • R.F. Love, J.G. Morris, G.O. Wesolowski: Facilities Location.


Further literature will be announced in the lecture.

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

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