Average-Case Analysis of Off-Line and On-Line Knapsack Problems (Q4225866)
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 1240571
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average-Case Analysis of Off-Line and On-Line Knapsack Problems |
scientific article; zbMATH DE number 1240571 |
Statements
Average-Case Analysis of Off-Line and On-Line Knapsack Problems (English)
0 references
17 January 1999
0 references
zero-one knapsack problem
0 references
OnLineGreedy
0 references
0.91642684
0 references
0.91335654
0 references
0.9107758
0 references
0.89601034
0 references
0.87111866
0 references
