Techniques of Combinatorial Optimization
Master Lecture: Department of Computer Science, Faculty of Mathematics and Computer Science, Winter Semester 2016/2017
Lecturer: Laurenţiu Leuştean
Time and location:
- Lectures: Tuesday, 16:00-18:00 (in Room 202)
- Seminars: Thursday, 16:00-18:00 and Thursday, 18:00-20:00 in Room 214 (in the even weeks)
- Office Hours: By appointment (send email to make one)
Information about the exam
Lecture Notes and Appendix version 17.01.2017
Seminar Sheets:
[1],
[2], [3], [4], [5], [6]
Solutions:
[1], [2], [3], [4], [5], [6].
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