The Knapsack Problem

  • Rene Beier
  • Berthold Vöcking

Abstract

For many important optimization problems no efficient solution algorithm is yet known – the only way to find the optimal solution is to compare all possible solutions. The time requirement for this simple procedure is of course dependent on the number of solutions, and hence in general it is very large. In this chapter the authors present an algorithm for solving a classic optimization problem – how best to pack a knapsack for a hike, taking into account the weight and the associated profit of each object carried.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Rene Beier
    • 1
  • Berthold Vöcking
    • 2
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany
  2. 2.RWTH AachenAachenGermany

Personalised recommendations