English

Objectives: The course aims to give knowledge in theory and solution methods for combinatorial optimization

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.

On completion of the course the student should have the following learning outcomes defined in terms of knowledge, skills and general competence:

Knowledge

The student

• knows the theory of combinatorial optimization problems

Skills

The student can

• formualate a combinatorial optimization problem efficiently
• model industrial planing problems in terms of combinatorial optimization

General competence

The student can

• explain how fast a combinatorial optimization problem can be solved
• explain the mathematical theory underlying algorithms for combinatorial optimization

The teaching is given in terms of lectures and group sessions

Lectures / 4 hours per week

Group sessions/ 2 hours per week

Student adviser:

mailto:studieveileder@ii.uib.nomailto:studieveileder@ii.uib.noStudent adviser

T: 55 58 42 00