Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
From MaRDI portal
(Redirected from Publication:333075)
Recommendations
- Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- The dynamic and stochastic knapsack problem
- The Dynamic and Stochastic Knapsack Problem with Deadlines
- Revenue maximization in the dynamic knapsack problem
Cites work
- scientific article; zbMATH DE number 4131489 (Why is no real title available?)
- scientific article; zbMATH DE number 4087408 (Why is no real title available?)
- scientific article; zbMATH DE number 3474804 (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?)
- A \((2/3)n^{3}\) fast-pivoting algorithm for the Gittins index and optimal stopping of a Markov chain
- A forwards induction approach to candidate drug selection
- A generalized Gittins index for a class of multiarmed bandits with general resource requirements
- ASYMPTOTIC BAYES ANALYSIS FOR THE FINITE-HORIZON ONE-ARMED-BANDIT PROBLEM
- Arm-acquiring bandits
- Discrete-variable extremum problems
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
- Dynamic allocation policies for the finite horizon one armed bandit problem
- Dynamic assortment with demand learning for seasonal consumer goods
- Dynamic portfolio selection of NPD programs using marginal returns
- Dynamic pricing in the presence of inventory considerations: research overview, current practices, and future directions
- Dynamic priority allocation via restless bandit marginal productivity indices
- Extensions of the multiarmed bandit problem: The discounted case
- General notions of indexability for queueing control and asset management
- Index policies for the maintenance of a collection of machines by a set of repairmen
- On an index policy for restless bandits
- Optimal resource allocation for multiqueue systems with a shared server pool
- Restless bandits, partial conservation laws and indexability
- Stochastic optimization for real time service capacity allocation under random service demand
- The cμ rule revisited
- The Multi-Armed Bandit Problem: Decomposition and Computation
- The complexity of optimal queuing network control
- Where are the hard knapsack problems?
Cited in
(10)- An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
- On the computation of Whittle's index for Markovian restless bandits
- Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)
- Gradient-based adaptive stochastic search for simulation optimization over continuous space
- Expectation analysis for bounding solutions of the 0-1 knapsack problem
- Model and algorithm for container allocation problem with random freight demands in synchromodal transportation
- Retail store operations: literature review and research directions
- Stochastic knapsack revisited: the service level perspective
- Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories
This page was built for publication: Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q333075)
