VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

401-3901-00L 11 Credits BSC , MSC D-ITET , D-MATH , D-INFK , D-BAUG
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.

Linear & Combinatorial Optimization

Lecturers & Examiners: Prof. Dr. Rico Zenklusen
VVZ CR 4.6

Last Updated: 2026-02-05 16:02:00

Abstract

Mathematical treatment of optimization techniques for linear and combinatorial optimization problems.

Objective

The goal of this course is to get a thorough understanding of various classical mathematical optimization techniques for linear and combinatorial optimization problems, with an emphasis on polyhedral approaches. In particular, we want students to develop a good understanding of some important problem classes in the field, of structural mathematical results linked to these problems, and of solution approaches based on such structural insights.

Content

Key topics include: - Linear programming and polyhedra; - Flows and cuts; - Combinatorial optimization problems and polyhedral techniques; - Equivalence between optimization and separation.

Resources

Literature

- Bernhard Korte, Jens Vygen: Combinatorial Optimization. 6th edition, Springer, 2018. - Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2003. This work has 3 volumes. - Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993. - Alexander Schrijver: Theory of Linear and Integer Programming. John Wiley, 1986.

Learning Materials (Links)

General Information

Language
English
Levels
BSC , MSC
Frequency
Yearly recurring

Examination

Type
session examination
Mode
written 180 minutes
Aids
None
There will be an optional graded interim exam in the second half of the semester. If the grade of the interim exam is better than the final one, then the interim exam contributes 30% to the final grade. If the grade of the interim exam is lower, or if the interim exam has not been taken, then the interim exam is ignored and the final grade for this course unit will be the grade of the final exam.Credits can only be recognized for either "Mathematical Optimization" or for the previously offered course "Combinatorial Optimization" (401-4904-00L), but not both.

Course Components

Type Title Time & Place Hours
lecture Linear & Combinatorial Optimization (Mathematical Optimization)
  • Wed 12:15-14:00 (HG G 5)
  • Thu 10:15-12:00 (HG G 5)
4 h weekly
exercise Linear & Combinatorial Optimization (Mathematical Optimization)
Groups are selected in myStudies. Thu 14-16 or Fri 10-12 or Fr 12-14 or Fri 14-16 (depending on demand)
  • Thu 14:15-16:00 (HG F 26.5)
  • Fri 10:15-12:00 (CAB G 51)
  • Fri 12:15-14:00 (LFW C 5)
  • Fri 14:15-16:00 (HG F 26.5)
2 h weekly

Offered In