bn:00937338n
Noun Concept
Categories: Weakly NP-complete problems, Pseudo-polynomial time algorithms, Combinatorial optimization, Articles with short description, Dynamic programming
EN
knapsack problem  0-1 Knapsack problem  0/1 knapsack problem  Algorithms for solving knapsack problems  Approximation algorithms for the knapsack problem
EN
The knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items to include in the collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. Wikipedia
Definitions
Relations
Sources
EN
The knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items to include in the collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. Wikipedia
A math problem Wikipedia Disambiguation