Graph Theory and Advanced Location Models

  • type: Lecture
  • semester: WS 19/20
  • place:

    Bdg. 20.40, Fritz-Haller lecture hall (HS37)

  • time:

    Tuesday, 15:45-17:15

  • lecturer:
  • sws: 2
  • lv-no.: 2550484
  • exam: see faculty page on examination dates: http://www.wiwi.kit.edu/pruefungstermine.php
  • information:

    Lecture and exercise materials are available in the ILIAS course. The exercise dates will be announced in the ILIAS course.

Contents

Graph Theory is an important part of Discrete Mathematics. A special attraction is in its clearness and variety of proof techniques. Topic of the first part “Graph Theory” is the mediation of basic graph theoretical concepts and algorithms, which are deployed in many areas of operations research. In focus is the modeling of different problems with graph theoretical methods und their solutions with efficient algorithms. Significant focal points are shortest paths, flows, matchings, colorings and matroids. A variety of application areas of location theory has attracted increasing research interest within the last decades, because location decisions are a critical factor in strategic planning. In the second part “Advanced Location Models”, some current research questions of modern industrial location theory are discussed after a short introduction. Thereby, practical models and suitable solution methods for location problems in general networks are presented. The lecture goes into details about pareto solutions in networks, ordered median problems, covering problems and allocation problems.