Description: Simple Matlab code for the 0-1 Knapsack problem: "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 a given limit and the total value is as large as possible"
To Search:
File list (Check if you may need any files):
AA_Report_Week06.docx
main.m
MatrixProductDC.m
MatrixProductDP.m
result.xlsx
Download