Course INF271
Combinatorial Optimization
Course offered :
- Current semester
- Next semester
Course offered by
| Number of credits | 10 |
| Course offered (semester) | Irregular |
| Subject overlap | I273: 10 ECTS |
| Schedule | Schedule |
| Reading list | Reading list |
Language of Instruction
English
Pre-requirements
Learning Outcomes
Upon completion of INF271 Combinatorial Optimization, the student is supposed to be able to
- formulate a combinatorial optimization problem efficiently
- explain how a combinatorial optimization problem can be solved
- explain how fast a combinatorial optimization problem can be solved
- explain the mathematical theory underlying the algorithms for combinatorial optimization problems.
Course offered (semester)
Irregular
Language of Instruction
English
Aim and Content
The course deals with theory and algorithms for solving integer and combinatorial optimization problems. Topics that are covered include models and algorithms for network flow, matching, assignment, matroids, knapsack problems, relaxations, tree search methods, and cutting plane methods.
Learning Outcomes
Upon completion of INF271 Combinatorial Optimization, the student is supposed to be able to
- formulate a combinatorial optimization problem efficiently
- explain how a combinatorial optimization problem can be solved
- explain how fast a combinatorial optimization problem can be solved
- explain the mathematical theory underlying the algorithms for combinatorial optimization problems.
Pre-requirements
Recommended previous knowledge
Subject Overlap
I273: 10 ECTS
Assessment methods
Oral exam.
No aids allowed.
Grading Scale
The grading scale used is A to F. Grade A is the highest passing grade in the grading scale, grade F is a fail.