michstg / Greedy-Algorithm-Implementation-In-Solving-The-Knapsack-Problem

Greedy Algorithm Implementation In Solving The Knapsack Problem Case to Maximum Profit

Greedy-Algorithm-Implementation-In-Solving-The-Knapsack-Problem-Case

Dataset = Logistics Services antaraja in Medan City

Times = 1-7 Work Days

Define Optimation Algorithm, Knapsack Problem, and Greedy Algorithm

• Greedy by profit
• Greedy by weight
• Greedy by density

Summary = The method with the biggest profit is greedy by density