Kies de Nederlandse taal
Course module: 191581100
Discrete Optimization
Course infoSchedule
Course module191581100
Credits (ECTS)6
Course typeCourse
Language of instructionEnglish
Contact personprof.dr. M.J. Uetz
Externe Docent
prof.dr. M.J. Uetz
prof.dr. M.J. Uetz
Contactperson for the course
prof.dr. M.J. Uetz
Academic year2021
Starting block
RemarksThis course is part of the Mastermath programme.
Application procedureYou apply via OSIRIS Student
Registration using OSIRISYes
Discrete Optimization addresses structural and algorithmic questions for finding the “best” among a set of feasible solutions. Often, this set of feasible solutions is finite, such as the set of maximal matchings in a finite graph, the set of vertices of a polytope, etc. Only since around the 1960s, starting with groundbreaking work of Jack Edmonds, researchers started to realize that the quality of procedures to solve such problems should be measured in terms of the algebraic dependence of computation time on problems size. Discrete Optimization has since then evolved into a rich mathematical area that connects to many other areas in mathematics but also computer science. Throughout the course, we consider several fundamental problems from this area and develop efficient algorithms to solve them.

This course is part of the Mastermath Program and is given at Universiteit Utrecht. Information about the course (description, organization, examination and prerequisites) can be found at the Mastermath website.
Assumed previous knowledge
Basic knowledge of algorithms, linear algebra and graph theory at the bachelor level. The material in "Appendix VIII: Mathematical Background" in the book "Introduction to Algorithms" by Cormen, Leiserson, Rivest, and Stein constitutes a good basis; it actually covers more background material than we will need in the course.
Participating study
Master Applied Mathematics
Required materials
Recommended materials
Instructional modes

Written exam

Kies de Nederlandse taal