IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-24777-7_8.html

The Unbounded 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

The availability of an unlimited number of copies for every item type leads to phenomena which are quite different from the bounded case described in Chapter 7. Although there is a natural bound of how many copies of any item type can fit into a knapsack the structure of the problem is in several aspects not the same as for the case with a prespecified bound. Hence, it is worthwhile to devote this separate chapter to the unbounded knapsack problem (UKP).

Suggested Citation

  • Hans Kellerer & Ulrich Pferschy & David Pisinger, 2004. "The Unbounded Knapsack Problem," Springer Books, in: Knapsack Problems, chapter 8, pages 211-234, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-24777-7_8
    DOI: 10.1007/978-3-540-24777-7_8
    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_8. 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.