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; zbMATH DE number 7530062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new class of hard problem instances for the 0-1 knapsack problem |
scientific article; zbMATH DE number 7530062 |
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
0.8458354473114014
0 references
0.8436415791511536
0 references
0.8336479663848877
0 references
0.8206185102462769
0 references
0.7969854474067688
0 references
