The online knapsack problem with incremental capacity (Q283993)
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 6581178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The online knapsack problem with incremental capacity |
scientific article; zbMATH DE number 6581178 |
Statements
The online knapsack problem with incremental capacity (English)
0 references
17 May 2016
0 references
online optimization
0 references
competitive analysis
0 references
knapsack problems
0 references
dynamic capacity
0 references
0.8173667192459106
0 references
0.8121391534805298
0 references
0.7953373789787292
0 references
0.7943060398101807
0 references
0.7887310981750488
0 references
