On the complexity of knapsack under explorable uncertainty: hardness and algorithms (Q7322392)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8248530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of knapsack under explorable uncertainty: hardness and algorithms |
scientific article; zbMATH DE number 8248530 |
Statements
On the complexity of knapsack under explorable uncertainty: hardness and algorithms (English)
0 references
31 August 2026
0 references
0 references
