The player can get 3 extra slots for either by equipping the Backpack or Knapsack. George Dantzig proposed a greedy approximation algorithm to solve the unbounded knapsack problem. Gleb Kotelnikov invented the knapsack parachute, while Evgeniy Chertovsky introduced the pressure suit. You could unpack his knapsack and take an inventory item by item. He delivered the cash-filled knapsack and parachutes to Mucklow via the aft stairs. A similar dynamic programming solution for the 0-1 knapsack problem also runs in pseudo-polynomial time. In this sense, many inlining algorithms are usually modeled after the Knapsack problem . Halkett later developed a two-man boat carried in a knapsack. A soldier returns home after 20 years of war, with three biscuits in his knapsack. With only one gem left, Finn finds the Enchiridion in Billy's knapsack. From the Hesperides he received a knapsack ("kibisis") to safely contain Medusa's head. Subset sum can also be thought of as a special case of the knapsack problem. For example, Knapsack was shown to be NP-complete by reducing Exact cover to Knapsack. A consecrated Host was discovered in his knapsack. This variation changes the goal of the individual filling the knapsack.