文件名称:optimal-for-knapsack-probelm
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
背包问题的多项式优化算法，实现了对目前用到的背包问题的算法的改进-an optimal algorithms for knapsack probelm
(系统自动生成,下载前可以参看下载内容)
下载文件列表
optimal for knapsack probelm\AddOneStep.m
............................\ConditionMatrix.asv
............................\ConditionMatrix.m
............................\ConstrainMatrix.asv
............................\ConstrainMatrix.m
............................\FindIndex.m
............................\Initial.asv
............................\Initial.m
............................\knapsack.asv
............................\knapsack.m
............................\LocationMatrix.m
............................\main.m
............................\NumToVec.asv
............................\NumToVec.m
............................\Show.asv
............................\SolvePolynomial.asv
............................\SolvePolynomial.m
............................\SubSolve.asv
............................\SubSolve.m
............................\SubTable.m
............................\Table.m
............................\ThetaCombine.m
............................\VecToNum.m
............................\ZeroOneConstrain.asv
............................\ZeroOneConstrain.m
............................\多项式优化算法(可以工作的第一版).rar
............................\.杂Ρ韁AddOneStep.asv
............................\......\AddOneStep.m
............................\......\FindIndex.asv
............................\......\FindIndex.m
............................\......\main.m
............................\......\SubTable.m
............................\......\Table.asv
............................\......\Table.m
............................\对应表
............................\结果记录.txt
optimal for knapsack probelm
............................\ConditionMatrix.asv
............................\ConditionMatrix.m
............................\ConstrainMatrix.asv
............................\ConstrainMatrix.m
............................\FindIndex.m
............................\Initial.asv
............................\Initial.m
............................\knapsack.asv
............................\knapsack.m
............................\LocationMatrix.m
............................\main.m
............................\NumToVec.asv
............................\NumToVec.m
............................\Show.asv
............................\SolvePolynomial.asv
............................\SolvePolynomial.m
............................\SubSolve.asv
............................\SubSolve.m
............................\SubTable.m
............................\Table.m
............................\ThetaCombine.m
............................\VecToNum.m
............................\ZeroOneConstrain.asv
............................\ZeroOneConstrain.m
............................\多项式优化算法(可以工作的第一版).rar
............................\.杂Ρ韁AddOneStep.asv
............................\......\AddOneStep.m
............................\......\FindIndex.asv
............................\......\FindIndex.m
............................\......\main.m
............................\......\SubTable.m
............................\......\Table.asv
............................\......\Table.m
............................\对应表
............................\结果记录.txt
optimal for knapsack probelm