Résumé
We study in this paper a variant of the knapsack problem where some of the items can be withdrawn from the knapsack. We show that our problem corresponds to a special case of the recoverable robust knapsack problem. While the complexity of the recoverable robust knapsack problem is still unknown, we propose a dynamic programming algorithm for our problem, proving that it can be solved in pseudo-polynomial time.