Inclusion-wise extremal knapsack problems are (mostly) hard to approximate

Fabio Ciccarelli, Fabio Furini, Ulrich Pferschy +1

We study two inclusion-wise extremal variants of the 0-1 Knapsack Problem (KP). Given $n$ items with integer weights and nonnegative costs or profits, the Minimum-Cost Maximal Knap…