Techniques of Combinatorial Optimization

NEW: You can see your exams on Tuesday, February 16, between 18.00 and 20.00, in Room 203.

Master Lecture: Department of Computer Science, Faculty of Mathematics and Computer Science, Winter Semester 2015/2016

Lecturer: Laurentiu Leustean

Time and location:

• Lectures: Monday, 18:00-20:00 (in Room 1) and Tuesday, 18:00-20:00 (in Room 202)
• Seminars: Thursday, 16:00-18:00 and Thursday, 18:00-20:00 in Room 8
• Office Hours: By appointment (send email to make one)

Course - Winter Semester 2014/2015

Informations about the exam

Lecture Notes version 28.01.2016

Seminar Sheets: [1], [2], [3], [4], [5]

Solutions: [1], [2], [3], [4], [5]

Related Courses and Lecture Notes:

• Chandra Chekuri, Topics in Combinatorial Optimization, University of Illinois at Urbana-Champaign, 2010
• Geir Dahl, An introduction to convexity, polyhedral theory and combinatorial optimization, University of Oslo, 1997
• Michel Goemans, Combinatorial Optimization, MIT, 2013
• Alexander Schrijver, A course in Combinatorial Optimization, University of Amsterdam, 2013

Books:

• A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, 3 Volumes, Springer, 2003
• B. Korte, J. Vygen, Combinatorial Optimization. Theory and Algorithms, Springer, 2000
• J. Lee, A First Course in Combinatorial Optimization, Cambridge University Press, 2004
• A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons, 1986
• R. Diestel, Graph Theory, 3rd edition, Springer, 2005
• C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover, 1998