搜索资源列表
0-1beibao
- 这是用贪心算法解决0-1背包问题的一个算法源码-something about 0-1 knapsack problems
1
- 0/1背包问题，C++实现，算法实现源代码，蛮力法实现源程序，-0/1 knapsack problem, C++ implementation, algorithm source code, brute force method to achieve source,
0-1_bag_problem
- 0-1背包问题的动态规划解法，C++源码，并附有详细的实验报告-0-1 bag problem
0-1bag-question
- 0-1背包问题 一种简单的算法 用c++实现的源代码-0-1bag question
0-1beibao
- 0-1背包问题，很经典的一个问题，基于动态规划的经典案例。-0-1 knapsack problem, it is a problem in the classic, classic case based on dynamic programming.
1.tar
- 用C++实现的0-1背包问题的动态规划解法程序。注释详实，可读性好。-C++ implementation with the 0-1 knapsack problem dynamic programming solution procedure. Comments detailed, readable.
1
- 遗传算法解决0-1背包问题，动态规划算法-Genetic algorithm to solve 0-1 knapsack problem, dynamic programming algorithm
ACG0-1
- 蚁群求解TSP问题，和0-1背包问题，不错，运行结果可以-ACO for TSP, and the 0-1 knapsack problem, yes, the results can be
0-1beibao
- 算法与分析中0/1背包问题的实现，求出最大价值及所放入的背包序号-Algorithms and Analysis 0/1 knapsack problem to achieve, find the maximum value and the serial number into the backpack
0-1bag
- 解决了0-1背包问题，能够的出最优解；并且可以知道各个背包的号码和总重量。-To solve the 0-1 knapsack problem, to the optimal solution and can know each number and total weight of the backpack.
0-1beibao
- 蚁群算法求解0-1背包问题，压缩包中有详细的代码和实验报告，可以调试运行-Ant Colony Algorithm for the 0-1 knapsack problem, compressed package are detailed in the code and lab reports, debugging and running
huisufa0-1
- 算法分析-回溯法，0-1背包问题，按选优条件向前搜索，以达到目标。-Algorithm- Backtracking，0-1Knapsack problem，Forward search, the optimal selection conditions in order to achieve the goal.
0-1beibaowenti(fenzhijiexiansuanfa)
- 本程序采用分支界限算法解决经典的0-1背包问题。-This program uses the branch and bound algorithm to solve the classical 0-1 knapsack problem.
0-1Package_c
- 0-1背包问题，C语言代码，txt文本，可以改编-0-1 package problem
0-1cc
- 0-1背包问题-分支限界法,算法设计课程作业-0-1 knapsack problem- branch and bound algorithm design course work
0-1hs
- 0-1背包问题-回溯法,算法设计课程作业-0-1 knapsack problem- Backtracking algorithm design course work
0-1-beibao-
- 0。1 背包问题，带有输入说明，和程序详细解释-0.1 knapsack problem, with input instructions, and procedures explained in detail
0-1bag
- 0—1背包问题，实现了经典背包问题.只是一个非常值得参考的算法。该算法简洁易懂，代码重用性强！-kanpsack problem which is a good algorithm for 0-1 kanosack problem!
SA0-1
- 模拟退火解决0—1背包问题，很好的套用模版-Simulated annealing to solve the 0-1 knapsack problem, apply the template
0-1packets
- 一个算法的实现：使用分支界限法求解0-1背包问题-The realization of an algorithm: 0-1 knapsack problem using the branch and bound method