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.

Hours

• Lecture : 20h