ECAM LaSalle Mechanical and Electrical Engineering Programme
Données Générales
Programme Académique ECAM LaSalle Mechanical and Electrical Engineering Programme Responsable(s) Module :
BARILLON Cristelle
Type d'EC : Cours Operations Research (LIIEEng08EOpeResearch)
TD : 6h00
 Cours : 12h00
 		Statut
Periode
Semester 8 		Langue d'enseignement :
English
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 100 Written exam