UE Academic and industrial challenges

This course offers the possibility for the students to gain some experience by facing open/difficult combinatorial problems.

The goal is to model and solve a combinatorial problem with direct industrial applications. We expect the students to take a variety of approaches (local search, compact/extended linear programming formulations, constraint programming, ...) and establish useful results (lower bounds, cuts, complexity,...).

The experimental results will be compared to the litterature (a known academic open benchmark will be available in this case) or will be validated by the industrial partner.