Sequential Ordering Problem challenge (Grenoble)

This project proposes to apply your OR knowledge to the sequential ordering problem. It gives the opportunity for the students to gain some experience by practicing knowledge they acquired during other lectures. We  expect the students to implement several models and algorithms (MIPs, cutting planes, constraint programming, metaheuristics ...) 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 project, 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