aeolus-project / notus

GNU General Public License v3.0
0 stars 0 forks source link

Preprocessing #2

Open arnaud-m opened 10 years ago

arnaud-m commented 10 years ago

Lower bounds based on knapsack or bin packing.. Greedy heuristics which handle conflicts ?