Network and Discrete Location Theory (4V+2U, 9.0 LP)
|SWS||Type||Course Form||CP (Effort)||Presence-Time / Self-Study|
|-||K||Lecture with exercise classes (V/U)||9.0 CP||186 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|| Master (Advanced)|
+ further Lecturers of the department Mathematics
|Area of study||[MAT-OPT] Optimisation|
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 (https://urm.mathematik.uni-kl.de)
Requirements for attendance (informal)
- [MAT-10-1-M-2] Fundamentals of Mathematics (M, 28.0 LP)
- [MAT-14-13-M-3] Linear and Network Programming (M, 9.0 LP)
- [MAT-50-11-M-4] Integer Programming: Polyhedral Theory and Algorithms (M, 9.0 LP)
Requirements for attendance (formal)None
References to Course [MAT-51-12-K-7]
|[MAT-51-12-M-7]||Network and Discrete Location Theory||P: Obligatory||4V+2U, 9.0 LP|