https://github.com/hxndev/implementing-knapsack-algorithm
The knapsack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible
https://github.com/hxndev/implementing-knapsack-algorithm
code constraint-satisfaction-problem kanpsack-problem knapsack-problem knapsack-solver knative python
Last synced: 9 months ago
JSON representation
The knapsack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible
- Host: GitHub
- URL: https://github.com/hxndev/implementing-knapsack-algorithm
- Owner: HxnDev
- License: mit
- Created: 2021-07-30T08:28:43.000Z (over 4 years ago)
- Default Branch: main
- Last Pushed: 2021-07-30T08:29:10.000Z (over 4 years ago)
- Last Synced: 2023-03-04T18:38:10.423Z (almost 3 years ago)
- Topics: code, constraint-satisfaction-problem, kanpsack-problem, knapsack-problem, knapsack-solver, knative, python
- Language: Python
- Homepage:
- Size: 122 KB
- Stars: 4
- Watchers: 1
- Forks: 0
- Open Issues: 0