Skip to content

Knapsack01 problem solution for finding all optimal subsets, solved in Python

License

Notifications You must be signed in to change notification settings

SCH227/Knapsack01

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Knapsack01

Whaat?

"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."

"The most common problem being solved is the 0-1 knapsack problem, which restricts the number of copies of each kind of item to zero or one."

 

mmm, and so?

Solved using Bottom-up Dynamic Programming approach.
Values and weights are read from "data.txt".
Capacity W is given in runtime.

numeric analisys

 

License

License

About

Knapsack01 problem solution for finding all optimal subsets, solved in Python

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages