Knapsack problem
E1466148
UNEXPLORED
The knapsack problem is a classic NP-complete optimization problem in combinatorial optimization, where one must select a subset of items with given weights and values to maximize total value without exceeding a capacity constraint.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Knapsack problem canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T21088253 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Knapsack problem Context triple: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Knapsack problem]
-
A.
Subset sum problem
The subset sum problem is a classic NP-complete decision problem in computer science that asks whether any subset of given integers sums to a specified target value.
-
B.
Knapsack Col
Knapsack Col is a high mountain pass in Wyoming’s Wind River Range, popular with backpackers and climbers traversing the rugged alpine terrain.
-
C.
general knapsack cryptosystem
The general knapsack cryptosystem is a public-key encryption scheme based on the computational hardness of the general subset sum (knapsack) problem, without relying on special structured sequences like superincreasing ones.
-
D.
Knappsack
Knappsack is a track from the album "Inviolate" by virtuoso guitarist Steve Vai, showcasing his intricate instrumental rock guitar work.
-
E.
A Combinatorial Problem
"A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Knapsack problem Target entity description: The knapsack problem is a classic NP-complete optimization problem in combinatorial optimization, where one must select a subset of items with given weights and values to maximize total value without exceeding a capacity constraint.
-
A.
Subset sum problem
The subset sum problem is a classic NP-complete decision problem in computer science that asks whether any subset of given integers sums to a specified target value.
-
B.
Knapsack Col
Knapsack Col is a high mountain pass in Wyoming’s Wind River Range, popular with backpackers and climbers traversing the rugged alpine terrain.
-
C.
general knapsack cryptosystem
The general knapsack cryptosystem is a public-key encryption scheme based on the computational hardness of the general subset sum (knapsack) problem, without relying on special structured sequences like superincreasing ones.
-
D.
Knappsack
Knappsack is a track from the album "Inviolate" by virtuoso guitarist Steve Vai, showcasing his intricate instrumental rock guitar work.
-
E.
A Combinatorial Problem
"A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
"Reducibility Among Combinatorial Problems" (1972)