Introduction to Linear and Combinatorial Optimization (ADM I)
Lecturer: Prof. Dr. Martin Skutella 
Assistant: Sven Jäger 
Lectures: Mo 10:15–11:45 (MA 043) and Th 14:15–15:45 (MA 041), first lecture: October 17
Exercise Sessions: Mo 12:15–13:45 (MA 043)
This course introduces the basics of linear and combinatorial optimization: Polyhedra, simplex algorithm, duality theory, algorithms for network problems, ellipsoid method. The course lays the ground for the course Discrete Optimization (ADM II).