A new class of hard problem instances for the 0-1 knapsack problem (Q2140267)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new class of hard problem instances for the 0-1 knapsack problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new class of hard problem instances for the 0-1 knapsack problem |
scientific article |
Statements
A new class of hard problem instances for the 0-1 knapsack problem (English)
0 references
20 May 2022
0 references
combinatorial optimization
0 references
0-1 knapsack problem
0 references
problem instance hardness
0 references
