Skip to main content
7 votes

Is 0-1 knapsack problem still NP-Hard (1) with an equality constraint and (2) when all the weights in the constraint are equal to one?

The general case where not all weights are equal to one, is ${NP}$ hard, as the subset sum problem reduces to it with a constant objective function. If all weights $w_i$ are equal to one, the problem ...
Sune's user avatar
  • 6,647

Only top scored, non community-wiki answers of a minimum length are eligible