Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (Q4393124)
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 1161018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems |
scientific article; zbMATH DE number 1161018 |
Statements
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (English)
0 references
10 August 1998
0 references
valid inequalities
0 references
optimal Lagrangian multipliers
0 references
branch-and-bound
0 references
0.8581973314285278
0 references
0.8565091490745544
0 references
0.848540186882019
0 references
0.8436415791511536
0 references
0.8394274115562439
0 references
