Skip to content
/ Greedy-Algorithm-Implementation-In-Solving-The-Knapsack-Problem Public

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

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

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

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits

README.md

README.md

 
 

Result Plots.jpg

Result Plots.jpg

 
 

greedy algorithm.ipynb

greedy algorithm.ipynb

 
 

research data anteraja.xlsx

research data anteraja.xlsx

 
 

Repository files navigation

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

About

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

Topics

python functional-programming greedy-algorithms knapsack-problem greedy-algorithm greedy-programming logistics-planning-problem medan knapsack-problem-greedy maximum-profit greedy-by-profit greedy-by-weight greedy-by-density

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages