The Partial Choice Recoverable Knapsack Problem

Clément Lesaege () and Michael Poss ()
Additional contact information
Clément Lesaege: Université de Technologie de Compiègne
Michael Poss: Universit de Montpellier

A chapter in Computational Management Science, 2016, pp 189-194 from Springer

Abstract: 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 (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-319-20430-7_24

Ordering information: This item can be ordered from
http://www.springer.com/9783319204307

DOI: 10.1007/978-3-319-20430-7_24

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().