MA413E - Combinatorial optimization

Objectives

General objective:

This course aims to develop the skills on quantitative methods from Operations Research for effective solving optimization problems in the Air Transportation domain (although not limited). Key concepts will be defined and classical results of linear programming and combinatorial optimization will be demonstrated.

Detailed objectives:

This course aims to develop the skills on quantitative methods from Operations Research for effective solving optimization problems in the Air Transportation domain (although not limited). Key concepts will be defined and classical results of linear programming and combinatorial optimization will be demonstrated.

At the end of the course, students will be capable to:

Identify an optimization problem in a real-world context
Formulate operational problems using mathematical modelling formalism: linear or integer linear programming
Understand mathematical and graph theory optimization algorithms (Simplex algorithm, Branch and bound method, Prim, Kruskal, Dijkstra, Bellman...)
Choose and apply an appropriate optimization algorithms to solve common optimization problems

Hours

• Lecture : 18h
• Supervised Practical Work : 12h

Form of assessment

Total assessment hours: 2