Academic and Industrial Challenges

This course proposes a set of academic problems. It gives the possibility for the students to gain some experience by practicing knowledge they acquired during other lectures. The goal is to model and solve a combinatorial problem. We expect the students to take a variety of approaches (local search, metaheuristics, constructive algorithm, Beam Search, Branch and Bounds, compact/extended linear programming formulations, constraint programming ...) and establish useful results (lower bounds, cuts, complexity ...). The experimental results will be compared to the literature we will provide. This course also provides a great opportunity to implement methods and algorithms presented in other courses.

At the end of this course, you will be able to:

Develop an optimization problem solving methodology
Implement common techniques from Operations Research such as MIP formulations, Local Search, constructive algorithms
Have a first experience in an operations research algorithm design challenge

Coordinator

Luc Libralesso