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

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

  •  18-06-2021
  •  | 
  •  

题

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?

有帮助吗？

解决方案

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

许可以下： CC-BY-SA 和 归因
不隶属于 StackOverflow
scroll top