Knapsack problem - related articles and key terms

Related articles: Dynamic programming   NP-complete   Computational complexity theory

Key terms: j   w   math   item   sum   value   weight   qquad   nw   knapsack problem   alpha   dominance   algorithm   iff   solution   zero   copies   boxes   solve   minus   maximum   optimal   ge p   greedy   integers   dynamic programming   exactly   subset sum   define   problema   assume   complexity   maximize   mathematics   each kind of item   instances   threshold   cryptography   given a set   nonnegative   special case   total weight   set of items   maximum value   unbounded knapsack problem   approximation   dominance relations   less than or equal   copies of each kind   dynamic programming solution


Search external links cited by footnotes on Wikipedia page Knapsack problem: