A dynamic programming approach to solving the assortment planning problem with multiple quality levels (Q1762140)
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: A dynamic programming approach to solving the assortment planning problem with multiple quality levels |
scientific article; zbMATH DE number 6107581
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic programming approach to solving the assortment planning problem with multiple quality levels |
scientific article; zbMATH DE number 6107581 |
Statements
A dynamic programming approach to solving the assortment planning problem with multiple quality levels (English)
0 references
15 November 2012
0 references
assortment planning
0 references
dynamic programming
0 references
line search
0 references
locational choice
0 references
0.8557486534118652
0 references
0.8079043030738831
0 references
0.7973881959915161
0 references
0.7895497679710388
0 references
