Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic (Q333075)
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: Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic |
scientific article; zbMATH DE number 6650050
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic |
scientific article; zbMATH DE number 6650050 |
Statements
Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic (English)
0 references
9 November 2016
0 references
resource allocation
0 references
Markov decision processes
0 references
knapsack problem
0 references
restless bandits
0 references
Whittle index
0 references
perishability
0 references
revenue management
0 references
retailing
0 references
0 references
0 references
0 references
0 references
0.8351378440856934
0 references
0.7989211082458496
0 references
0.7972725033760071
0 references
0.7965338826179504
0 references
0.7945693135261536
0 references
