用动态规划、分支限界、回溯解决01背包、批处理作业调度问题

上传者: m0_37896011 | 上传时间: 2019-12-21 20:16:40 | 文件大小: 2.07MB | 文件类型: rar
用动态规划、分支限界、回溯解决01背包、批处理作业调度问题

文件下载

资源详情

[{"title":"( 32 个子文件 2.07MB ) 用动态规划、分支限界、回溯解决01背包、批处理作业调度问题","children":[{"title":"Algorithm","children":[{"title":"Algorithm","children":[{"title":"01_动态规划.cpp <span style='color:#111;'> 957B </span>","children":null,"spread":false},{"title":"mask_回溯.cpp <span style='color:#111;'> 1.29KB </span>","children":null,"spread":false},{"title":"01_回溯法.cpp <span style='color:#111;'> 807B </span>","children":null,"spread":false},{"title":"Algorithm.vcxproj <span style='color:#111;'> 4.29KB </span>","children":null,"spread":false},{"title":"01_分支限界.cpp <span style='color:#111;'> 1.61KB </span>","children":null,"spread":false},{"title":"head.h <span style='color:#111;'> 2.20KB </span>","children":null,"spread":false},{"title":"main.cpp <span style='color:#111;'> 615B </span>","children":null,"spread":false},{"title":"Algorithm.vcxproj.filters <span style='color:#111;'> 1.52KB </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"01_回溯法.obj <span style='color:#111;'> 133.04KB </span>","children":null,"spread":false},{"title":"vc120.pdb <span style='color:#111;'> 380.00KB </span>","children":null,"spread":false},{"title":"Algorithm.Build.CppClean.log <span style='color:#111;'> 606B </span>","children":null,"spread":false},{"title":"mask_回溯.obj <span style='color:#111;'> 154.15KB </span>","children":null,"spread":false},{"title":"vc120.idb <span style='color:#111;'> 371.00KB </span>","children":null,"spread":false},{"title":"Algorithm.tlog","children":[{"title":"CL.write.1.tlog <span style='color:#111;'> 5.44KB </span>","children":null,"spread":false},{"title":"CL.read.1.tlog <span style='color:#111;'> 51.54KB </span>","children":null,"spread":false},{"title":"unsuccessfulbuild <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"cl.command.1.tlog <span style='color:#111;'> 3.62KB </span>","children":null,"spread":false},{"title":"Algorithm.lastbuildstate <span style='color:#111;'> 157B </span>","children":null,"spread":false},{"title":"link.write.1.tlog <span style='color:#111;'> 896B </span>","children":null,"spread":false},{"title":"link.command.1.tlog <span style='color:#111;'> 1.74KB </span>","children":null,"spread":false},{"title":"link.read.1.tlog <span style='color:#111;'> 3.38KB </span>","children":null,"spread":false}],"spread":false},{"title":"01_分支限界.obj <span style='color:#111;'> 237.33KB </span>","children":null,"spread":false},{"title":"Algorithm.log <span style='color:#111;'> 765B </span>","children":null,"spread":false},{"title":"01_动态规划.obj <span style='color:#111;'> 132.98KB </span>","children":null,"spread":false},{"title":"mask_分支限界.obj <span style='color:#111;'> 164.42KB </span>","children":null,"spread":false}],"spread":true},{"title":"mask_分支限界.cpp <span style='color:#111;'> 4.74KB </span>","children":null,"spread":false}],"spread":true},{"title":"Algorithm.sdf <span style='color:#111;'> 8.06MB </span>","children":null,"spread":false},{"title":"Algorithm.sln <span style='color:#111;'> 973B </span>","children":null,"spread":false},{"title":"Algorithm.v12.suo <span style='color:#111;'> 29.00KB </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"Algorithm.ilk <span style='color:#111;'> 684.18KB </span>","children":null,"spread":false},{"title":"Algorithm.pdb <span style='color:#111;'> 971.00KB </span>","children":null,"spread":false},{"title":"Algorithm.exe <span style='color:#111;'> 98.00KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明