Digital Teaching
The lectures will be given via zoom.
Lehrinhalte
Modeling: systems of linear equalities and inequalities in integers; theory: integer programs, polyhedral combinatorics; methods: exact algorithms, approximation, decomposition methods algorithms, heuristics, relaxations
Literature
Nemhauser, Wolsey: Integer and Combinatorial Optimization, Wiley 1988,
Schrijver: Theory of Linear and Integer Programming, Wiley 1986,
Korye, Vygen: Combinatorial Optimization, Springer 2012
Voraussetzungen
recommended: Introduction to Optimization, Algorithmic Discrete Mathematics
Online-Angebote
moodle
The lectures will be given via zoom.
Lehrinhalte
Modeling: systems of linear equalities and inequalities in integers; theory: integer programs, polyhedral combinatorics; methods: exact algorithms, approximation, decomposition methods algorithms, heuristics, relaxations
Literature
Nemhauser, Wolsey: Integer and Combinatorial Optimization, Wiley 1988,
Schrijver: Theory of Linear and Integer Programming, Wiley 1986,
Korye, Vygen: Combinatorial Optimization, Springer 2012
Voraussetzungen
recommended: Introduction to Optimization, Algorithmic Discrete Mathematics
Online-Angebote
moodle
- Lehrende: Maximilian Gläser
- Lehrende: Andreas Paffenholz
Semester: ST 2021