Approximating the optimal sequence of acquisitions and sales with a capped budget (Q2348705)
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: Approximating the optimal sequence of acquisitions and sales with a capped budget |
scientific article; zbMATH DE number 6445933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the optimal sequence of acquisitions and sales with a capped budget |
scientific article; zbMATH DE number 6445933 |
Statements
Approximating the optimal sequence of acquisitions and sales with a capped budget (English)
0 references
15 June 2015
0 references
approximation
0 references
greedy algorithms
0 references
knapsack problem
0 references
0.7255102396011353
0 references
0.711691677570343
0 references
0.7087481021881104
0 references
0.7081513404846191
0 references
