Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic

DOI10.1007/S10479-013-1312-9zbMATH Open1348.90619OpenAlexW2172140255MaRDI QIDQ333075FDOQ333075

Publication date: 9 November 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/65371/1/kppi13_springer_aor_rev2.pdf

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

knapsack problem resource allocation Whittle index Markov decision processes perishability retailing revenue management restless bandits

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Markov and semi-Markov decision processes (90C40)

Cites Work

Arm-acquiring bandits
Restless bandits, partial conservation laws and indexability
A \((2/3)n^{3}\) fast-pivoting algorithm for the Gittins index and optimal stopping of a Markov chain
Title not available (Why is that?)
Dynamic pricing in the presence of inventory considerations: research overview, current practices, and future directions
Extensions of the multiarmed bandit problem: The discounted case
Title not available (Why is that?)
On an index policy for restless bandits
Title not available (Why is that?)
Where are the hard knapsack problems?
The cμ rule revisited
Dynamic portfolio selection of NPD programs using marginal returns
General notions of indexability for queueing control and asset management
Discrete-variable extremum problems
Dynamic assortment with demand learning for seasonal consumer goods
The Multi-Armed Bandit Problem: Decomposition and Computation
Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
Index policies for the maintenance of a collection of machines by a set of repairmen
Stochastic optimization for real time service capacity allocation under random service demand
The complexity of optimal queuing network control
A generalized Gittins index for a class of multiarmed bandits with general resource requirements
A forwards induction approach to candidate drug selection
Title not available (Why is that?)
Dynamic allocation policies for the finite horizon one armed bandit problem
Title not available (Why is that?)
ASYMPTOTIC BAYES ANALYSIS FOR THE FINITE-HORIZON ONE-ARMED-BANDIT PROBLEM
Optimal resource allocation for multiqueue systems with a shared server pool
Dynamic priority allocation via restless bandit marginal productivity indices

Cited In (10)

Stochastic knapsack revisited: the service level perspective
On the computation of Whittle's index for Markovian restless bandits
Model and algorithm for container allocation problem with random freight demands in synchromodal transportation
An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition
Expectation analysis for bounding solutions of the 0-1 knapsack problem
Gradient-based adaptive stochastic search for simulation optimization over continuous space
Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)
Retail store operations: literature review and research directions
A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
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)