Average time per problem was less than a second, and the maximum time for any single problem was 3 seconds. Value-independent 0-1 knapsack problems (also randomly generated), were solved with a ...

The knapsack sharing problem has a utility or tradeoff function for each variable and seeks to maximize the value of the smallest tradeoff function (a maximin objective function). A single constraint ...