0
I Use This!
Activity Not Available
Analyzed over 1 year ago. based on code collected almost 2 years ago.

Project Summary

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 : decouenn@fiifo.u-psud.fr

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!

Tags

java

In a Nutshell, projetro...

Common Public License 1.0
Permitted

Sub-License

Use Patent Claims

Commercial Use

Modify

Distribute

Forbidden

Hold Liable

Required

Disclose Source

Include Copyright

Include License

These details are provided for information only. No information here is legal advice and should not be used as such.

All Licenses

This Project has No vulnerabilities Reported Against it

Did You Know...

  • ...
    Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
  • ...
    data presented on the Open Hub is available through our API
  • ...
    nearly 1 in 3 companies have no process for identifying, tracking, or remediating known open source vulnerabilities
  • ...
    anyone with an Open Hub account can update a project's tags

Languages

Languages?height=75&width=75
Java
98%
2 Other
2%

30 Day Summary

Jun 22 2016 — Jul 22 2016

12 Month Summary

Jul 22 2015 — Jul 22 2016

Ratings

Be the first to rate this project
Click to add your rating
   Spinner
Review this Project!