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