TU Berlin

Combinatorial Optimization & Graph Algorithms group (COGA)Introduction to Linear and Combinatorial Optimization (ADM I)

COGA 5-Wheel

Page Content

to Navigation

Introduction to Linear and Combinatorial Optimization (ADM I)

Lecturer: Prof. Dr. Martin Skutella

Assistant: Sven Jäger

Lectures: Mo 10:15–11:45 (MA 041) and Fr 14:15–15:45 (MA 041)

Exercise Sessions: We 12:15–13:45 (MA 041)

Tutorial Sessions: Mo 12:15–13:45 (MA 549), Tu 10:15–11:45 (MA 749), Tu 12:15–13:45 (MA 549)

Language: English

There will be a written exam at the end of the semester.


This course introduces the basics of linear and combinatorial optimization: Simplex algorithm, duality theory, algorithms for network problems, complexity theory, NP hard problems, ellipsoid method. The course lays the ground for the course Discrete Optimization (ADM II).

Further information will be available on ISIS.


Quick Access

Schnellnavigation zur Seite über Nummerneingabe