Informations générales
Number of hours
- Lectures 23.0
- Projects -
- Tutorials 23.0
- Internship -
- Laboratory works 2.0
- Written tests -
ECTSECTS
4.0
Goal(s)
Modelling and Solving complex decision problems with advanced methods.
Responsible(s)
Sylvain BOUVERET, Jean-Louis ROCH, Nadia VETTIER
Content(s)
- Mixed Integer Programmaing : modelisation, Branch and Bound, Integer Polyhedron
- Dynamic programming for OR
- Approximation algorithms
- Computational social choice: how to cut the pie, voting theory...
- Operations Research methodology and decision support tools in their environment (industry, society)
Basic Operational Research course (graphs and linear programming).
It is recommended that students take the Combinatorial Optimisation course beforehand.
Test
Evaluation : Examen écrit (3h)
Resit : Examen écrit (3h)
Calendar
The course exists in the following branches:
- Curriculum - Core curriculum - Semester 7
Additional Information
Course ID : 4MMROAC
Course language(s): 
You can find this course among all other courses.
Bibliography
Integer Programming, L. Wolsey
Theory of Linear and Integer Programming, A. Schrijver
Combinatorial Optimization: Algorithms and Complexity Christos H. Papadimitriou,Kenneth Steiglitz Dover Publications,Inc
Iterative Methods in Combinatorial Optimization Lap Chi Lau Cambridge
Algorithms, Dasgupta, Papadimitriou and Vazirani