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.
Unable to display preview. Download preview PDF.