| Code | Lecturer(s) | Associate Lecturer(s) | Subsitute Lecturer(s) et other(s) |
|---|---|---|---|
| I-MARO-153 |
|
| Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term |
|---|---|---|---|---|---|---|---|
| Français | Français | 36 | 4 | 0 | 0 | 0 | Q2 |
Contents
Basic notions of graph theory and data structure; study of classical graph theory problems : trees, shortest paths, connexity, flows;introduction to complexity theory : P and NP classes; study of classical combinatorial optimization problems : knapsack, set covering, travelling salesman; introduction to metaheuristics.
Required Reading
Required Learning Resources/Tools
Not applicable
Recommended Reading
Recommended Learning Resources/Tools
Not applicable.
Other Recommended Reading
P. Lacomme, C. Prins & M. Sevaux Algorithmes de graphes, Editions Eyrolles, 2003. J. Dréo, A. Pétrowski, P. Siarry & E. taillard Métaheuristiques pour l'optimisation difficile, Editions Eyrolles, 2003.
Mode of delivery
- Face to face
Term 1 Assessment - comments
Not applicable
Term 2 Assessment - type
- Written examination
Term 2 Assessment - comments
Written examination covering both parts of the course: Graph theory : (theory and exercises) 50% Combinatorial optimization : (theory and exercises) 50%
Term 3 Assessment - type
- Written examination
Term 3 Assessment - comments
Written examination covering both parts of the course: Graph theory : (theory and exercises) 50% Combinatorial optimization : (theory and exercises) 50%
Resit Assessment - Term 1 (B1BA1) - Comments
Not applicable
Type of Teaching Activity/Activities
- Cours (cours magistraux; conférences)
- Ateliers et projets encadrés au sein de l'établissement