The project's mission and goals : Our project will solve the "robust knapsack" combinatory problem, a typical operationnal research problem. We will use several resolution methods, such as semi definite programming method, Lagrange relaxation or variable neighborhood search.
This project is a work project of a french students group in IT, and is not intended to be sold
How to contact you : You can ask questions to this e-mail address : firstname.lastname@example.org
How to participate - Are you accepting roles and which one? Sorry but you will understand that our professors want us to do the project alone!
Use Patent Claims
These details are provided for information only. No information here is legal advice and should not be used as such.