文件名称: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
main.m
MatrixProductDC.m
MatrixProductDP.m
result.xlsx
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者,仅为网络服务对象提供信息存储空间,仅对用户上载内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。