https://github.com/aem/knapsack

https://github.com/aem/knapsack

Last synced: 21 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/aem/knapsack
• Owner: aem
• Created: 2015-10-07T16:06:19.000Z (about 9 years ago)
• Default Branch: master
• Last Pushed: 2015-10-15T05:03:58.000Z (about 9 years ago)
• Last Synced: 2024-10-04T11:21:38.088Z (3 months ago)
• Language: Python
• Size: 145 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Knapsack Solver

This is a Python solver for the traditional knapsack problem.

The premise of the problem is simple. Given a set of objects with given weights

and values, as well as a knapsack with a capacity "x", find the set of objects

that will maximize the value of the knapsack while keeping the knapsack's weight

under capacity.