Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand (Q2806071)
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: Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand |
scientific article; zbMATH DE number 6580650
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand |
scientific article; zbMATH DE number 6580650 |
Statements
13 May 2016
0 references
assortment planning
0 references
dynamic substitution
0 references
polynomial time approximation schemes
0 references
0 references
0 references
Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand (English)
0 references
0.9032710790634156
0 references
0.8912910223007202
0 references
0.8720868825912476
0 references
0.8663718700408936
0 references
0.8498766422271729
0 references
