文件名称:backpackbranchandbound
介绍说明－－下载内容均来自于网络，请自行研究使用
这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm
(系统自动生成,下载前可以参看下载内容)
下载文件列表
01背包分支限界
..............\01背包分支限界.dsp
..............\01背包分支限界.dsw
..............\01背包分支限界.ncb
..............\01背包分支限界.opt
..............\01背包分支限界.plg
..............\111.cpp
..............\Debug
..............\.....\01背包分支限界.exe
..............\.....\01背包分支限界.ilk
..............\.....\01背包分支限界.pdb
..............\.....\111.obj
..............\.....\vc60.idb
..............\.....\vc60.pdb
..............\01背包分支限界.dsp
..............\01背包分支限界.dsw
..............\01背包分支限界.ncb
..............\01背包分支限界.opt
..............\01背包分支限界.plg
..............\111.cpp
..............\Debug
..............\.....\01背包分支限界.exe
..............\.....\01背包分支限界.ilk
..............\.....\01背包分支限界.pdb
..............\.....\111.obj
..............\.....\vc60.idb
..............\.....\vc60.pdb