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.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kellerer, H., Pferschy, U., Pisinger, D. (2004). The Bounded Knapsack Problem. In: Knapsack Problems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24777-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-24777-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07311-3
Online ISBN: 978-3-540-24777-7
eBook Packages: Springer Book Archive