Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)

Electronic Notes in Discrete Mathematics

Volumn 28, Issue , 2007, Pages 145-152

  Jacko, Peter ^a   Niño Mora, José ^a  

^a UNIVERSIDAD CARLOS III DE MADRID   (Spain)

Author keywords

finite horizon; index policy heuristic; knapsack problem; perishable items; restless bandits

Indexed keywords

EID: 33847250491     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2007.01.021     Document Type: Article

References (10)

1. Gittins J.C. Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society, Series B 41 2 (1979) 148-177
2. Gittins J.C. Multi-Armed Bandit Allocation Indices (1989), J. Wiley & Sons, New York
3. Kleywegt A.J., and Papastavrou J.D. The dynamic and stochastic knapsack problem. Operations Research 46 1 (1998) 17-35
4. Manor G., and Kress M. Optimality of the greedy shooting strategy in the presence of incomplete damage information. Naval Research Logistics 44 (1997) 613-622
5. Niño-Mora J. Restless bandits, partial conservation laws and indexability. Advances in Applied Probability 33 1 (2001) 76-98
6. Niño-Mora J. Dynamic allocation indices for restless projects and queueing admission control: A polyhedral approach. Mathematical Programming, Series A 93 3 (2002) 361-413
7. Niño-Mora, J. (2005). Marginal productivity index policies for the finite-horizon multiarmed bandit problem. In Proceedings of the 44th IEEE CDC and ECC '05, pages 1718-1722
8. Papadimitriou C.H., and Tsitsiklis J.N. The complexity of optimal queueing network. Mathematics of Operations Research 24 2 (1999) 293-305
9. Pisinger D. Where are the hard knapsack problems?. Computers & Operations Research 32 (2005) 2271-2284
10. Whittle P. Restless bandits: Activity allocation in a changing world. In: Gani J. (Ed). A Celebration of Applied Probability. Journal of Applied Probability 25A (1988) 287-298