Optimization Spring 2003

Lecturers:

Dr. Friedrich Eisenbrand	Bau 46 (MPI), Zimmer 428
Dr. Stefan Funke	Bau 46 (MPI), Zimmer 307

Contents:

Linear optimization is a key subject in theoretical computer science. Many combinatorial problems, such as shortest paths, maximum flows, maximum matchings in graphs, among others have a natural formulation as a linear (integer) optimization problem. In this course you will learn:

• how to optimize a linear function subject to linear constraints
• how to formulate combinatorial problems as (integer) linear optimization problems
• how to solve them

Dates:

Tuesday, 11:00-13:00	Geb. 45,  HS 001
Thursday, 11:00-13:00	Geb. 45, HS 001
Midterm Exam	Thursday June 12, 11-13h s.t.
Final Exam	Tuesday July 29, 10-13h s.t., HS 002
First lecture	Thursday April 24

Language:

The lecture will be held in english. There will be an exercise groups held in german and english. 

Grading:

 The credit for this course is 9 graded Leistungspunkte. The credit is awarded upon successful participation at the final exam.  The course grade is only determined by the grade of the final exam. Sucessful participation in the exercises and a midterm exam are necessary to be admitted to the final exam.