2025-01-22 13:41:46

2025-01-22 13:41:46 -04:00
parent 2eb98aa15b
commit 2e28778412
4 changed files with 7 additions and 5 deletions
--- a/2/CS3383/Lecture
+++ b/2/CS3383/Lecture
@@ -34,3 +34,5 @@ Given a set S of n items, with each item i having a positive benefit factor, b,
 Goal: Choose items with maximum total benefit but with weight at most W.

 If we are allowed to take factional amounts, then this is the fractional knapsack problem. The objective is to maximize the benefit given the amount divided by the weight, with the constraint that the amount is less than the total amount W.
+
+### Interval Partitioning: Greedy