GitHub / 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
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HxnDev%2FImplementing-Knapsack-Algorithm
Stars: 4
Forks: 0
Open issues: 0
License: mit
Language: Python
Size: 122 KB
Dependencies parsed at: Pending
Created at: over 3 years ago
Updated at: over 3 years ago
Pushed at: over 3 years ago
Last synced at: 22 days ago
Topics: code, constraint-satisfaction-problem, kanpsack-problem, knapsack-problem, knapsack-solver, knative, python