Advanced Topics in Discrete Optimization
The seminar website, that includes the list of papers, schedule and updates, can be accessed via the following link (to the moodle system of ETH):
In this seminar we will discuss selected topics in discrete optimization. The main focus is on modern approaches to combinatorial optimization, including linear programming and polyhedral methods. Additional topics include approximation algorithms and online/streaming algorithms.
The goal of the seminar is twofold. On the one hand, the students will learn and practice presenting scientific papers to an audience. On the other hand, the students will be exposed to cutting-edge research in the field of combinatorial optimization. An active participation in the seminar should allow the student to later read and understand a paper in the topic of discrete optimization independently. Students intending to do a project in optimization are strongly encouraged to participate.
Each student is required to present one paper and attend all of the course meetings. Students should select a paper from the list below, in rare cases a student will be allowed to present an unlisted paper that aligns with the course topic.