Techniques of Combinatorial Optimization

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

Lecturer: Laurentiu Leustean

Time and location:

• Lectures: Tuesday, 08:00-10:00 and Wednesday, 16:00-18:00 in Lecture Hall "Simion Stoilow"
• Seminars: Wednesday, 18:00-20:00 and Thursday, 16:00-20:00 in Room 5
• Office Hours: By appointment (send email to make one)

Exams: [1], [2]

Informations about the exam and homeworks

Lecture Notes version 20.01.2014

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

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

Homework 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