Benchmarks

The CDA team concentrates also on the solution of NP-complete combinatorial optimization problems via efficient sequential and parallel algorithms. These pages are devoted to the problems we have solved in various papers.

           
If you want to obtain the codes and instances, then please contact us: {vboyer, mlalami, elbaz} at laas.fr
 
Knapsack sharing problems          Multiple knapsack          Knapsack problems