Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)
From MaRDI portal
Recommendations
- Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories
- Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
- The Dynamic and Stochastic Knapsack Problem with Deadlines
- The stochastic knapsack problem
- The dynamic and stochastic knapsack problem
Cites work
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
- scientific article; zbMATH DE number 4087408 (Why is no real title available?)
- scientific article; zbMATH DE number 3638998 (Why is no real title available?)
- scientific article; zbMATH DE number 1084192 (Why is no real title available?)
- scientific article; zbMATH DE number 194374 (Why is no real title available?)
- Restless bandits, partial conservation laws and indexability
- The complexity of optimal queuing network control
- The dynamic and stochastic knapsack problem
- Where are the hard knapsack problems?
Cited in
(2)
This page was built for publication: Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439578)