Algorithmique et recherche opérationnelle

Introduction to mathematical modelling (linear programs). Algorithmic problems in graph theory.

After completing this teaching unit the student will be capable to conceptualize algorithmic methods and structures. He will manage the bacic concepts of mathematical modeling and solving optimisation problems (linear programming).

Cours co-requis

Lectures and exercise sessions.

Contribution to the teaching profile

Be capable of formulating and solving complex or open-ended technical and scientific problems by using abstraction, modeling, simulation, and multi-disciplinary analysis while satisfying the requirements of university-level research and responding to requirements, constraints, the set context and the technical, socio-economical ethical and environmental stakes—all with the purpose of obtaining concrete solutions. Design, develop, realize, and exploit solutions (products, systems, services, software etc) in the domain of Computer Science. Innovate, by combining rigor and creativity, using a critical and demanding scientifical methodology (including state-of-the-art, problem statement, fixing hypothesis, modeling, validation, argumentation, and peer-review).

References, bibliography, and recommended reading

Cormen, Leiserson, Rivest, and Stein, "Introduction to Algorithms", MIT Press.

Contacts

Bernard Fortz Campus de la Plaine NO building ROOM: 2.N3.203

Yves De Smet - Campus de la Plaine - NO building ROMM: 2N3 216

Method(s) of evaluation

• written examination

written examination

Written exam

Mark calculation method (including weighting of intermediary marks)

40% theory + 40% exercices + 20% project

Language(s) of evaluation

• french