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.
Notice