Code
IGFE NET 7432
Domain
Réseaux
Program
Master
Language
English
ECTS Credits
4
Class hours
30
Workload
27
Program Manager(s)
Department
- Réseaux et Services Multimédia Mobiles
Organisation
Cours/TD/TP/projet/examen : 12/12/3/0/3Learning objectives
After the course the student will be able to:
- prove basic results in graph theory and optimisation theory;
-model practical problems using graph optimization techniques or as oprimization programs with continous/integer variables.
- propose and implement methods to solve such problems
Content
Content of the course:
-CI 1 (3h) : Introduction to graph theory and computational complexity
-CI 2 (3h) : Shortest path problems
-CI 3 (3h) : Flow on networks
-CI 4 (3h) : Linear programming and the simplex method
-CI 5 (3h) : Integer programming
-TP 1 (3h) : Solving MILP with Julia
-CI 6 (3h) : Unconstrained non-linear optimization
-CI 7 (3h) : Constrained non-linear optimization
-CI 8 (3h) : Further topics and recap exercises
Assessment formula
- 1st session: written exam, authorised documents: polycopiés
- 2nd session: oral exam