knapsack problem

noun

A 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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

nounknapsack problem (plural knapsack problems)

plural knapsack problems

  1. A 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.
Cite this entry
APA

knapsack problem. (n.d.). In WatkinsX Dictionary. Retrieved November 2, 2026, from https://dictionary.watkinsx.com/word/knapsack%20problem

MLA

“knapsack problem.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/knapsack%20problem. Accessed November 2, 2026.

Chicago

WatkinsX Dictionary, s.v. “knapsack problem,” accessed November 2, 2026, https://dictionary.watkinsx.com/word/knapsack%20problem.

Source: knapsack problem on Wiktionary, CC BY-SA 4.0.