Mathematische Methoden der Algorithmik

Lecture: Tuesday, 9:45 - 11:15, SN 19.4.

Tutorial: Wednesday, 15:00 - 16:30, TBA.

Studienleistung: 50 percent of the homework.

''Prüfungsleistung'': Oral or written exam.

The topic is linear and integer programming. Besides the theoretical basics, the students learn to model problems as such programs and how to solve them:

1. Linear optimization
2. Simplex algorithm
3. Duality
4. Integer optimization

The main reference for this course is Linear Programming: Foundations and Extensions by Robert J. Vanderbei (SpringerLink). There is a lot of additional literature on the topic:

1. Matousek and Gärtner: Understanding and Using Linear Programming (Springer).
2. A. Schrijver: Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, 1998 (s-tlip-98, BibTeX)
3. V. Chvátal: Linear Programming, Series of Books in the Mathematical Sciences, W.H. Freeman, 1983 (c-lp-83, BibTeX)
4. Einführung in die Mathematische Optimierung - Burkard und Zimmermann Free access from the university network.

Mailing list

If you are interested in the course, please register for the mailing list!

Material

The learning material will be published here.

Homework

The homework sheets will be published here.