Code | Lecturer(s) | Associate Lecturer(s) | Subsitute Lecturer(s) et other(s) |
---|---|---|---|
I-MARO-011 |
|
Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term |
---|---|---|---|---|---|---|---|
Français | Français | 30 | 6 | 0 | 0 | 0 | Q1 |
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 - type
- Written examination
- Practical Test
Term 1 Assessment - comments
Reports of practical works : 20% Written examination including : Theory 40% and exercises 40%.
Term 2 Assessment - comments
Not applicable
Term 3 Assessment - type
- Written examination
- Practical test
Term 3 Assessment - comments
Reports of practical works : 20% Written examination including : Theory 40% and exercises 40%.
Resit Assessment - Term 1 (B1BA1) - Comments
Not applicable
Type of Teaching Activity/Activities
- Cours (cours magistraux; conférences)
- Travaux pratiques / travaux de laboratoire / exercices de création et recherche en atelier / projet sur ordinateur /études de cas