The Knapsack Problem and Straightforward Optimization Methods

Günther Zäpfel (), Roland Braune () and Michael Bögl ()
Additional contact information
Günther Zäpfel: Universität Linz
Roland Braune: Universität Linz
Michael Bögl: Universität Linz

Chapter Chapter 2 in Metaheuristic Search Concepts, 2010, pp 7-29 from Springer

Abstract: 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.

Keywords: Solution Space; Greedy Algorithm; Search Tree; Knapsack Problem; Packing Problem (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-11343-7_2

Ordering information: This item can be ordered from
http://www.springer.com/9783642113437

DOI: 10.1007/978-3-642-11343-7_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().