Graph Theory is an important part of Discrete Mathematics. A special attraction is in its clearness and variety of proof techniques. Object of the first part “Graph Theory” is the mediation of basic graph theoretical concepts and algorithms, which are deployed in many areas. 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.

• Jungnickel: Graphs, Networks and Algorithms, 2^nd edition, Springer, 2005
• Diestel: Graph Theory, 3^rd edition, Springer, 2006
• Bondy, Murt: Graph Theory, Springer, 2008
• Nickel, Puerto: Location Theory, Springer, 2005
• Drezner: Facility Location – Applications and Theory, 2^nd edition, Springer, 2005