Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic (Q333075): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10479-013-1312-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-013-1312-9 / rank | |||
Normal rank | |||
Revision as of 00:01, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic |
scientific article |
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
