Courses: INF271 Combinatorial Optimization - Spring 2017

Credits

10.0

Language of Instruction

English

Teaching semester

Irregular

Objectives 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.

Required Previous Knowledge

INF270

Recommended Previous Knowledge

INF270

Forms of Assessment

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.

Subject Overlap

I273: 10 ECTS