0/1 knapsack problem "solved" with a greedy algorithm. "Solution" is guaranteed to be at least 50 percent of the optimal solution.
https://bitbucket.org/trebsirk/algori...
On this page of the site you can watch the video online 0/1 knapsack greedy using python with a duration of hours minute second in good quality, which was uploaded by the user Kris Wright 24 March 2014, share the link with friends and acquaintances, this video has already been watched 15,467 times on youtube and it was liked by 58 viewers. Enjoy your viewing!