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

The Knapsack Problem and Straightforward Optimization Methods

In: Metaheuristic Search Concepts

Author

Listed:
  • Günther Zäpfel

    (Universität Linz)

  • Roland Braune

    (Universität Linz)

  • Michael Bögl

    (Universität Linz)

Abstract

In the previous chapter we gave some examples for optimization problems in the application area of production and logistics. Recall the cargo-loading problem we described at last which consists in choosing an optimal subset of available products for shipping. In the theory of optimization this task is categorized under a special class of problems, called packing problems. Precisely speaking, we are facing a subclass of packing problems, called knapsack problems. The basic idea of optimally packing items into a single object, i.e. a knapsack in the simplest case, serves as an abstract model for a broad spectrum of packing, loading, cutting, capital budgeting or even scheduling problems. In order to provide a general basis for the subsequent chapters, we will first introduce an example knapsack optimization problem and then discuss various different approaches to solve it.

Suggested Citation

  • Günther Zäpfel & Roland Braune & Michael Bögl, 2010. "The Knapsack Problem and Straightforward Optimization Methods," Springer Books, in: Metaheuristic Search Concepts, chapter 0, pages 7-29, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-11343-7_2
    DOI: 10.1007/978-3-642-11343-7_2
    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 search for a similarly titled item that would be available.

    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-642-11343-7_2. 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.