> Formation > Cursus ingénieur
Learn how to formulate problems liable to be solved by combinatorial optimization's technics.
In this course we present the principles of operations research. The concepts and techniques of linear programming are studied in detail. Some other fundamental ideas of graph theory, some results and methods of combinatorial optimization like spanning tree, optimal path, scheduling, heuristic algorithms are exhibit by formulation and computation exercises.
PrerequisitesNone but requires a good mathematical skill.
2 written exams (3h)
The course exists in the following branches:
Course ID : 3MM1RO
Course language(s):
The course is attached to the following structures:
You can find this course among all other courses.
W. BIENIA : "Introduction à la recherche opérationnelle et optimisation combinatoire", polycopié 2009
V. CHVATAL : "Linear programming", W.H. Freeman Company, 1983
G. FINKE at al “Recherche Opérationnelle et réseaux” traité IGAT, HERMES, 2002
Date of update January 15, 2017
Nos sites
e-Services
