401-3900-16L  Advanced Topics in Discrete Optimization

SemesterFrühjahrssemester 2018
DozierendeD. Adjiashvili, C. Kalaitzis
Periodizitätjährlich wiederkehrende Veranstaltung
KommentarMaximale Teilnehmerzahl: 26

KurzbeschreibungIn 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.
LernzielThe 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.
InhaltThe selected topics will cover various classical and modern results in combinatorial optimization, focusing on papers that present important modern polyhederal tools.
SkriptThis seminar has no script.
LiteraturThe learning material will be in the form of scientific papers.
Voraussetzungen / BesonderesRequirements: Mathematical Optimization or Introduction to Mathematical Optimization (or equivalent course) strongly suggested.