A note on the max-min 0-1 knapsack problem (Q1304387)
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 1339730
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the max-min 0-1 knapsack problem |
scientific article; zbMATH DE number 1339730 |
Statements
A note on the max-min 0-1 knapsack problem (English)
0 references
17 February 2000
0 references
surrogate relaxation
0 references
linear programming relaxation
0 references
branch-and-bound
0 references
max-min 0-1 knapsack problem
0 references
0.7817890644073486
0 references
0.7689913511276245
0 references
0.759928822517395
0 references
0.7541809678077698
0 references
