The classical deterministic knapsack problem involves a knapsack of capacity C resource units and K classes of objects, with class-k objects having size b κ . Objects may be placed into the knapsack as long as the sum of their sizes does not exceed the knapsack capacity. A reward is r κ accrued whenever a class-k object is placed into the knapsack. The problem is to place the objects into the knapsack so as to maximize the total reward.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- The Stochastic Knapsack
PhD Keith W. Ross
- Springer London
- Chapter 2