Advertisement

The Partial Choice Recoverable Knapsack Problem

  • Clément Lesaege
  • Michael Poss
Conference paper
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 682)

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.

Keywords

Integer Linear Programming Knapsack Problem Dynamic Programming Algorithm Large Instance Shipping Company 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    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
  2. 2.
    Büsing, C., Koster, A.M.C.A., Kutschka, M.: Recoverable robust knapsacks: the discrete scenario case. Optim. Lett. 5(3), 379–392 (2011)CrossRefGoogle Scholar
  3. 3.
    Monaci, M., Pferschy, U., Serafini, P.: Exact solution of the robust knapsack problem. Comput. Oper. Res. 40(11), 2625–2631 (2013)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.UMR CNRS 7253 HeudiasycUniversité de Technologie de CompiègneCompiègneFrance
  2. 2.UMR CNRS 5506 LIRMMUniversit de MontpellierMontpellier Cedex 5France

Personalised recommendations