Knapsack & Assigment Problem

The Multidimensional Knapsack Problem is a classic problem in combinatorial optimization, and several sets of benchmark instances exist. We give results for five of those sets. For each instance, we g