19400701
Lecture
WiSe 18/19: Optimization
Alexander Bockmayr, Knut Reinert
Comments
Linear programming, Simplex algorithm, duality, integer linear programming, branch and bound, cutting planes, branch and cut, constraint programming, local search and metaheuristics.
The students should get a deeper understanding of advanced mathematical notions and methods in discrete mathematics and optimisation. They should be able to develop discrete mathematical models for problems in bioinformatics and systems biology, to apply suitable algorithms for their solution, and to analyse the results.
close16 Class schedule
Additional appointments
Thu, 2019-04-18 12:00 - 14:00Nachklausur
Regular appointments
Tue, 2018-12-11 10:00 - 12:00
Tue, 2018-12-18 10:00 - 12:00
Tue, 2019-01-08 10:00 - 12:00
Tue, 2019-01-15 10:00 - 12:00
Tue, 2019-01-22 10:00 - 12:00
Tue, 2019-01-29 10:00 - 12:00
Tue, 2019-02-05 10:00 - 12:00
Tue, 2019-02-12 10:00 - 12:00
Thu, 2018-12-13 10:00 - 12:00
Thu, 2018-12-20 10:00 - 12:00
Thu, 2019-01-10 10:00 - 12:00
Thu, 2019-01-17 10:00 - 12:00
Thu, 2019-01-24 10:00 - 12:00
Thu, 2019-01-31 10:00 - 12:00
Thu, 2019-02-07 10:00 - 12:00
Thu, 2019-02-14 10:00 - 12:00