19400702
Übung
WiSe 18/19: Übung zu Optimierung
Markus Arthur Köbis
Kommentar
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.
15 Termine
Zusätzliche Termine
Fr, 15.02.2019 12:00 - 14:00Klausur
Regelmäßige Termine der Lehrveranstaltung
Fr, 14.12.2018 12:00 - 14:00
Fr, 21.12.2018 12:00 - 14:00
Fr, 11.01.2019 12:00 - 14:00
Fr, 18.01.2019 12:00 - 14:00
Fr, 25.01.2019 12:00 - 14:00
Fr, 01.02.2019 12:00 - 14:00
Fr, 08.02.2019 12:00 - 14:00
Fr, 14.12.2018 14:00 - 16:00
Fr, 21.12.2018 14:00 - 16:00
Fr, 11.01.2019 14:00 - 16:00
Fr, 18.01.2019 14:00 - 16:00
Fr, 25.01.2019 14:00 - 16:00
Fr, 01.02.2019 14:00 - 16:00
Fr, 08.02.2019 14:00 - 16:00
Fr, 15.02.2019 14:00 - 16:00