The Bounded Knapsack Problem

Hans Kellerer (), Ulrich Pferschy () and David Pisinger ()
Additional contact information
Hans Kellerer: University of Graz, Department of Statistics and Operations Research
Ulrich Pferschy: University of Graz, Department of Statistics and Operations Research
David Pisinger: University of Copenhagen, DIKU, Department of Computer Science

Chapter 7 in Knapsack Problems, 2004, pp 185-209 from Springer

Abstract: Abstract Right from the beginning of research on the knapsack problem in the early six-ties separate considerations were devoted to problems where a number of identical copies of every item are given or even an unlimited amount of each item is available. The corresponding problems are known as the bounded and unbounded knapsack problem, respectively. Since there exists a considerable amount of theoretical, algorithmic and computational results which apply for only one of these two problems, we found it appropriate to deal with them in separate chapters. Hence, we restrict this chapter to the bounded case whereas the unbounded case will be treated in Chapter 8.

Keywords: Dynamic Programming; Greedy Algorithm; Knapsack Problem; Dynamic Programming Algorithm; Item Type (search for similar items in EconPapers)
Date: 2004
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:sprchp:978-3-540-24777-7_7

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

DOI: 10.1007/978-3-540-24777-7_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().