Course for international guest/part time students
- Faculty
- Faculty of Science
- Organization
- TTK Department of Operations Research
- Code
- doptim1u0um20em
- Title
- Discrete optimization (l)
- Usual semester
- Autumn
- Published semester
- 2026/27/1
- ECTS
- 3
- Language
- en
- Learning outcomes
- Knowledge: getting familiar with the main notions of graph theory and matroid theory Ability: compentence in using combinatorial algorithms Attitude: the need to deepen the applied mathematical knowledge, to gain new applied mathematical skills, to develop competencies. Aspiration to apply the mathematical knowledge for a wide range of problems Autonomy and Responsibility: based on the gained knowledge in the theory of discrete optimization, the students are able to decide which tools are the most suitable to solve applied problems
- Course content
- Basic notions of graph theory and matroid theory, properties and methods (matchings, flows and circulations, greedy algorithm, perfect graphs). Elements of polyhedral combinatorics (totally unimodular matrices and applications). Fundamental combinatorial algorithms (optimal arborescences and matchings).
- Assessment method
- exam
- Bibliography
- lecture notes