Coursebooks 2017-2018

PDF
 

Combinatorial optimization

MATH-460

Lecturer(s) :

Language:

English

Remarque

pas donné en 2017-18

Summary

The guiding question of Combinatorial Optimization is: How do I efficiently select an optimal solution among a finite but very large set of alternatives? We will address the solution of this question in the context of classical discrete optimization problems.

Content

Keywords

 

Learning Prerequisites

Required courses

Discrete optimization (Second year math.)

Learning Outcomes

By the end of the course, the student must be able to:

Transversal skills

Teaching methods

Ex cathedra lecture and exercises to be solved at home and in  the classroom

 

Expected student activities

Attendance of lectures and exercises

Completion of exercises at home

Study of literature

Assessment methods

Written exam during exam session

Supervision

Office hours Yes
Assistants Yes
Forum No

Resources

Bibliography

Alexander Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Springer-Verlag.

In the programs

Reference week

 MoTuWeThFr
8-9     
9-10     
10-11     
11-12     
12-13     
13-14     
14-15     
15-16     
16-17     
17-18     
18-19     
19-20     
20-21     
21-22     
 
      Lecture
      Exercise, TP
      Project, other

legend

  • Autumn semester
  • Winter sessions
  • Spring semester
  • Summer sessions
  • Lecture in French
  • Lecture in English
  • Lecture in German