文件名称:Week06
介绍说明－－下载内容均来自于网络，请自行研究使用
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"
(系统自动生成,下载前可以参看下载内容)
下载文件列表
AA_Report_Week06.docx
main.m
MatrixProductDC.m
MatrixProductDP.m
result.xlsx