Fractional Knapsack

---

what is Fractional Knapsack?

see Wikipedia

In theoretical computer science, Fractional Knapsack problem is an algorithmic problem in combinatorial optimization in which the goal is to fill a container (the "knapsack") with fractional amounts of different materials chosen to maximize the value of the selected materials. It is also referred to as Continuous Knapsack.

Collaborative effort by OpenGenus