General Engineering Program
| Données Générales | ||||
|---|---|---|---|---|
| Programme Académique | General Engineering Program | Responsable(s) Module :
GAGNEUX Antoine |
||
| Type d'EC : Cours | Operational Research (LIIAem08ERechOp) | |||
|
TD : 4h00 Cours : 12h00 Travail personnel : 8h00 Durée totale: 24h00 |
Status
|
Periode
Academic Semester |
Langue d'enseignement :
French |
|
| Objectifs Généraux |
|---|
| This course introduces Operations research as an optimization process on the particular context of graph theory. In this course, we will explain well-known problems of operations research as the shortest path, minimum spanning tree, and maximum flow. We will study how to modeling into graph and which algorithms solve that kind of problem. Five competences will be evaluated in relation to: - Vocabulary and mathematical concepts - Problem modeling - Application of algorithms - Adaptation of a known algorithm - Interpretation of a result |
| Contenu |
|---|
| Course outline: - Graphs: definitions - Connectivity - Shortpath problem - Hamitonians paths and heuristic - Minimum spanning tree - Graphs coloration - Maximum flow - Assignment Problem - Binpacking |
| Prérequis |
|---|
| Fundamentals of algorithms: conditions, loops, arrays, lists, trees |
| Bibliographie |
|---|
| - Roseaux, "Exercices et problèmes résolus de recherche opérationnelle", Tome 1, Dunod, Paris 2002, 296p. - M. Gondran, M. Minoux, "Graphes et Algorithmes", Eyrolles, Paris 1995, 588p. - R. Faure, B. Lemaire, C. Picouleau, "Précis de recherche opérationnelle", Dunod, 2000, 520p. |
| Évaluation(s) | |||
|---|---|---|---|
| N° | Nature | Coefficient | Objectifs |
| 1 | Written exam | 1 | General assessment on the entire course. - Vocabulary and mathematical concepts - Problem modeling - Application of algorithms - Adaptation of a known algorithm - Interpretation of a result |