Title: The Partial Choice Recoverable Knapsack Problem
Abstract: 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.
Publication Year: 2016
Publication Date: 2016-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot