Metraipolis › archive › dc_237759c96dd4

Knapsack problem — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Knapsack_problem
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T17:33:24.489Z
SHA-256 of the archived text
d0f05b95659339f769a8e668a343217cdee85140a7a490bc021c6953bfc272d3
Stable URL of this page
https://metraipolis.com/documento/dc_237759c96dd4

How to cite

Knapsack problem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Knapsack_problem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_237759c96dd4 (Metraipolis archive dc_237759c96dd4, sha256 d0f05b95659339f769a8e668a343217cdee85140a7a490bc021c6953bfc272d3)
BibTeX
@misc{dc237759c96dd4,
  title = {Knapsack problem — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Knapsack_problem},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_237759c96dd4; sha256 d0f05b95659339f769a8e668a343217cdee85140a7a490bc021c6953bfc272d3},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Knapsack_problem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items. The problem often arises in resource allocation where the decision-makers have to choose from a set of non-divisible projects or tasks under a fixed budget or time constraint, respectively. The knapsack problem has been studied for more than a century, with early works dating back to 1897. The subset sum problem is a special case of the decision and 0-1 problems where for each kind of item, the weight equals the value: w i = v i {\displaystyle w_{i}=v_{i}} . In the field of cryptography, the term knapsack problem is often used to refer specifically to the subset sum problem. The subset sum problem is one of Karp's 21 NP-complete problems.

Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «Merkle tree»).
Fonte: Wikipedia in inglese, voce «Knapsack problem» — https://en.wikipedia.org/wiki/Knapsack_problem
Wikidata Q864457 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q864457
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Knapsack_problem?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1378445512, consultata il 2026-10-15T16:24:48.556Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 27312c73b02482647949bf8e2647b982b78ce66ecc74abc3d306ffbbd1578c28