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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Büsing, C., Koster, A.M., Kutschka, M.: Recoverable robust knapsacks: gamma-scenarios. In: Proceedings of INOC 2011, International Network Optimization Conference. Lecture Notes on Computer Science, vol. 6701, pp. 583–588. Springer, Heidelberg (2011). http://dx.doi.org/10.1007/978-3-642-21527-8_65
Büsing, C., Koster, A.M.C.A., Kutschka, M.: Recoverable robust knapsacks: the discrete scenario case. Optim. Lett. 5(3), 379–392 (2011)
Monaci, M., Pferschy, U., Serafini, P.: Exact solution of the robust knapsack problem. Comput. Oper. Res. 40(11), 2625–2631 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Lesaege, C., Poss, M. (2016). The Partial Choice Recoverable Knapsack Problem. In: Fonseca, R., Weber, GW., Telhada, J. (eds) Computational Management Science. Lecture Notes in Economics and Mathematical Systems, vol 682. Springer, Cham. https://doi.org/10.1007/978-3-319-20430-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-20430-7_24
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20429-1
Online ISBN: 978-3-319-20430-7
eBook Packages: Business and ManagementBusiness and Management (R0)