Operations Research - 4GMA0623
A+Augmenter la taille du texteA-Réduire la taille du texteImprimer le documentEnvoyer cette page par mail
Number of hours
- Lectures : 12.75
- Tutorials : 12.75
- Laboratory works : 31.5
- Projects : -
- Internship : -
- Written tests : -
ECTS : 3.0
-
Goals
The students are expected to
• Know, understand and to be able to apply the algorithms designed for fundamental problems of Operations Research: spanning tree, shortest paths, maximum flow, knapsack, ...
• Model an optimization problem in various frameworks: integer linear programming, graph theory and dynamic programming.
Content The course covers various topics:
• Integer Linear Programming
• Dynamic Programming
• Graph Theory
• Models for problems encountered in production planning and logistic
Implementation of the algorithms is made in Java and a case study also requires the use of a linear programming solver.
PrerequisitesThis class requires some background in computer science and algorithmic. Basic knowledge in java programming are required to implement the case study.
Tests Continuous assessment: case study and online evaluation.
Final exam: written examination (2 hours)
Retake exam: written or oral examination
N1 = 40%CC + 60%EXAM1
N2 = 100%EXAM2
Bibliography Programmation lineaire: 65 problèmes modélisés et résolus avec l'outil Visual Xpress. Christelle Guéret, Christian Prins et Marc Sevaux, Eyrolles, 2000.
Gestion de la production et des flux, Vincent Giard, Economica, 2003.
H. Stadtler and C. Kilger, Supply Chain Management and Advanced Planning, Springer, 2002.
A+Augmenter la taille du texteA-Réduire la taille du texteImprimer le documentEnvoyer cette page par mail