Time-constrained restless bandits and the knapsack problem for perishable items (Extended Abstract)

Jacko, Peter and Niño-Mora, José (2007) Time-constrained restless bandits and the knapsack problem for perishable items (Extended Abstract). Electronic Notes in Discrete Mathematics, 28. pp. 145-152. ISSN 1571-0653

Preview

PDF (cs06)
cs06.pdf - Accepted Version
Download (150kB)

Official URL: https://doi.org/10.1016/j.endm.2007.01.021

Abstract

Motivated by a food promotion problem, we introduce the Knapsack Problem for Perishable Items (KPPI) to address a dynamic problem of optimally filling a knapsack with items that disappear randomly. The KPPI naturally bridges the gap and elucidates the relation between the PSPACE-hard restless bandit problem and the NP-hard knapsack problem. Our main result is a problem decomposition method resulting in an approximate transformation of the KPPI into an associated 0-1 knapsack problem. The approach is based on calculating explicitly the marginal productivity indices in a generic finite-horizon restless bandit subproblem.

Item Type:

Journal Article

Journal or Publication Title:

Electronic Notes in Discrete Mathematics

Additional Information:

The final, definitive version of this article has been published in the Journal, Electronic Notes in Discrete Mathematics 28, 2007, © ELSEVIER.

Uncontrolled Keywords:

/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch

Subjects:

?? KNAPSACK PROBLEMPERISHABLE ITEMSRESTLESS BANDITSFINITE HORIZONINDEX POLICY HEURISTICDISCRETE MATHEMATICS AND COMBINATORICSAPPLIED MATHEMATICSDISCIPLINE-BASED RESEARCH ??

Departments:

Lancaster University Management School > Management Science

ID Code:

71358

Deposited By:

ep_importer_pure

Deposited On:

21 Oct 2014 13:25

Refereed?:

Published?:

Published

Last Modified:

19 Sep 2023 01:18

URI:

https://eprints.lancs.ac.uk/id/eprint/71358