搜索资源列表
01beibao
- 01 背包 自己编写的一个小算法 希望够帮助大家-Back pack
01packet
- 使用分支限界法解决01背包问题，c++代码实现，能够正确运行-Using the branch and bound method to solve the 01 knapsack problem, c++ code to run properly
pack_problem
- 根据网上的《背包九讲》写了前三个(01背包、完全背包、多重背包)的C++代码，抛砖引玉。-According to the online "backpack problem," wrote the first three (01 backpack, backpack full, multi-pack) on behalf of C Code, start a discussion.
knapsack
- 背包九讲问题，各种高效解法，值得一看，包括01背包，完全背包，多重背包，一起三种背包的混合问题-Backpack nine speak problems, all kinds of efficient solution, is worth a look Including 01 backpack, completely backpack, multiple backpack, together three backpack of the mixed problem
01bag
- 动态规划经典问题01背包的实现，用2种实现算法。一是用递归，二是用循环。还有01背包算法的叙述和图解，通俗易懂-Dynamic programming 01bag
0_1bag
- 01背包问题,用最简单的算法解决了01背包问题-01bag question
bag
- 使用C++实现的01背包小程序可以在vc下运行-a algorith of 01 bag can run in VC directly
knap-error
- 利用c++语言进行01背包问题回溯法解决实际问题-knapsack problem
tanlan-suanfa
- 01背包算法用来加固电路,可以用于在瞬态电路里的测试-to build the circuits
beibaowenitjiejuefangga
- 01背包问题及其解法研究 背包问题及其解法研究-bag problerm slove voice
package01
- 动态规划解决01背包问题，简单易懂,适合初学者!-package 01 program
01
- 这是我们大学里的课程设计，实现简单的0、 1背包问题，目的就是用最少的资源做做多的事情- This is our university course design, realization simple 0, 1 knapsack problem, the purpose is to use the minimal resource do more things
suanfa
- 分支限界法解决01背包问题，适用于算法上机作业-Branch and bound method to solve the 01 knapsack problem
KNAPSACK
- 背包问题,动态规划实现了01背包和贪心算法部分背包-Knapsack problem, 01 backpack and full backpack
knapsack
- 01背包问题的matlab的实现，方便大家下载学习。-01 knapsack problem matlab realize, convenient download learning.
DKNAP
- 用Vc++6.0编写的01背包问题。内包含源码及结果截图。-Written in Vc++6.0 with 01 knapsack problem. Contains source and results of screenshots.
beibao
- 01背包中的实现 用五种不同的方法实现-The 01 backpack realization using five different methods to achieve
beibao
- 用简单的c语言实现简单的01背包程序源代码，方法比较简单。-Simple c language the the 01 backpack program source code, the method is relatively simple.
Knap
- 采用回溯法解决01背包问题，数据输入为当前目录下的data.txt文件；-Backtracking to solve knapsack problem 01, data input data.txt file in the current directory
01backpack
- 用回溯法解决01背包问题，C++实现，通过读取data.txt文件得到背包容量和物品信息，下载文件后直接导入运行即可。-Backtracking to solve knapsack problem 01, C++ implementation, read the data.txt file the backpack capacity and items of information, to download the file directly import can be run.