MA5051 - Advanced combinatorial optimisation

MA5051 - Advanced combinatorial optimisation

Objectives

General objective:

Understading advanced tools in discrete optimization, knowing when to apply each method, being able to use the methods (small implementaton exercices)

Detailed objectives:

Advanced in discrete optimization:
- Benders
- Dantzig-Wolfe
- Column generation
- Branch-and-price
- Lagrangian decomposition

Position in the programme

Linear programming, Integer programming, Simplex method, branch-and-bound, duality.

This course is part of the programme

In brief

ECTS credits 3

Contact(s)

Marcel MONGEAU

Phone : 05.62.25.95.73

Email : marcel.mongeau @ enac.fr