IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-24777-7_7.html
   My bibliography  Save this book chapter

The Bounded Knapsack Problem

In: Knapsack Problems

Author

Listed:
  • 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)

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.

Suggested Citation

  • Hans Kellerer & Ulrich Pferschy & David Pisinger, 2004. "The Bounded Knapsack Problem," Springer Books, in: Knapsack Problems, chapter 7, pages 185-209, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-24777-7_7
    DOI: 10.1007/978-3-540-24777-7_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-24777-7_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.