An iterative dynamic programming approach for the temporal knapsack problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles European Journal of Operational Research Year : 2021

An iterative dynamic programming approach for the temporal knapsack problem

Abstract

In this paper, we address the temporal knapsack problem (TKP). In this generalization of the classical knapsack problem, selected items enter and leave the knapsack at fixed dates. We solve the TKP with a dynamic program of exponential size, which is solved using a method called Successive Sublimation Dynamic Programming (SSDP). This method starts by relaxing a set of constraints from the initial problem, and iteratively reintroduces them when needed. We show that a direct application of SSDP to the temporal knapsack problem does not lead to an effective method, and that several improvements are needed to compete with the best results from the literature.
Fichier principal
Vignette du fichier
TKP_EJOR_Rev2_HAL.pdf (457.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02044832 , version 1 (21-02-2019)
hal-02044832 , version 2 (29-11-2019)
hal-02044832 , version 3 (24-06-2021)

Identifiers

Cite

François Clautiaux, Boris Detienne, Gaël Guillot. An iterative dynamic programming approach for the temporal knapsack problem. European Journal of Operational Research, 2021, 293 (2), ⟨10.1016/j.ejor.2020.12.036⟩. ⟨hal-02044832v3⟩
435 View
1003 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More