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

The Unbounded Knapsack Problem

In: Research Trends in Combinatorial Optimization

Author

Listed:
  • T. C. Hu

    (University of California, San Diego, Department of Computer Science and Engineering)

  • Leo Landa

    (University of California, San Diego, Department of Computer Science and Engineering)

  • Man-Tak Shing

    (Naval Postgraduate School, Department of Computer Science)

Abstract

Summary This paper presents a survey of the unbounded knapsack problem. We focus on the techniques for obtaining the optimal solutions, particularly those using the periodic structure of the optimal solutions when the knapsack weight-carrying capacity b is sufficiently large. In addition to reviewing existing algorithms on the subject, the paper also includes two new algorithms, one for finding the onset of the optimal periodic solutions in time O(nw 1), where w 1 is the weight of the best item, i.e. the item with the highest value-to-weight ratio, and a second one for finding the optimal solutions when the capacity b is below the critical value where the optimal periodic solution begins. The second algorithm has a worst-case time complexity of O(nw 1 v 1), where v 1 is the value of the best item.

Suggested Citation

  • T. C. Hu & Leo Landa & Man-Tak Shing, 2009. "The Unbounded Knapsack Problem," Springer Books, in: William Cook & László Lovász & Jens Vygen (ed.), Research Trends in Combinatorial Optimization, chapter 10, pages 201-217, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-76796-1_10
    DOI: 10.1007/978-3-540-76796-1_10
    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

    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-76796-1_10. 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.