Is the 0-1 Knapsack that each item has the same weight NP-complete?

StackOverflow https://stackoverflow.com/questions/11249448

  •  18-06-2021
  •  | 
  •  

Question

The 0-1 Knapsack problem is known as NP-complete. But if the weight for each item are the same, the problem is still NP-complete?

Was it helpful?

Solution

No, because you always just take whatever items are the most valuable.

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top