搜索资源列表
sa_01.zip
- 本程序是在MATLAB平台上面实现的用模拟退火算法解决01背包问题。,This procedure is in the MATLAB platform achieved with simulated annealing algorithm to solve knapsack problem 01.
01_beibao
- 学习算法分析时必须掌握的算法。01背包，经典无需多言。我以前的作业。-Learning algorithm analysis must master algorithm. 01 backpack, classic Needless to say. My previous job.
贪心算法
- 文件输入的01背包贪心算法，下载后手动添加一个文件即可运行
package
- 详细介绍有多个背包的01背包问题，此问题是NP问题，不能用一般算法解决，此资料提供了一些分析，和一些近似算法-There are a number of details of the 01 backpack knapsack problem, this problem is NP problem, the general algorithm can not be resolved, this information provides some analysis, and some approxi
01package
- 01背包问题的贪心法源代码 供给有需要的参考-01 knapsack problem greedy algorithm source code
cpp
- 大二算法设计实验源码，内容包括线性时间选择，01背包，骑士巡游，最小生成树-Experimental Algorithm Design sophomore source, including choice of linear time, 01 backpacks, Cavalier Parade, minimum spanning tree
01pack
- 01背包问题，计算机算法中使用贪心算法与贪心策略的实现-01 knapsack problem, the computer algorithm with the greedy algorithm using the greedy strategy to achieve
01pack
- 01背包问题,用动态规划实现的,里面讲得很详细-01 knapsack problem, using dynamic programming to achieve, which made detailed
01beibaosuanfa_java
- 01背包四种算法实现(java版)， 是大学算法可的课程设计-01 backpack four algorithms (java version), a university curriculum design algorithm
01beibaoshutafugai
- 这是学习动态规划时用动态规划设计分析实际问题，用动态规划方法设计的数塔问题，棋盘覆盖，和01背包问题的源码，希望朋友们需要的话可以下载-This is used to study dynamic programming dynamic programming design and analysis of practical problems, using dynamic programming method of a number of tower design problem, board c
01packbag
- 01 背包问题的 c语言源代码实现 很简单-01 knapsack problem c language source code of the implementation
01bag
- 用回溯方法写的01背包问题，有中文注释，很容易懂！-Methods used to write back the 01 knapsack problem, a Chinese note, it is easy to understand!
01bag
- 01背包问题最简单实现，可在其上做更多的扩展，不知道可否不用递归用堆栈-01 knapsack problem to achieve the most simple, can do more in its expansion, I do not know can not use recursive stack
01knapsack_BY_shinyea
- 动态规划的01背包问题。用C++编写的简单程序。内置物品价值和重量数组。-Dynamic Programming Knapsack Problem 01. Using C++ to prepare a simple procedure. Built-in value and weight of the array.
beibaozhongyao
- 01背包问题是重要的问题，需要解决。C++解决该问题的方式易懂简介。-beibao
01package
- 01背包算法 解决算法 与众大侠一起参考 交流 -01 knapsack algorithm to solve algorithm and the public with reference to the exchange of heroes
beibao
- 此代码实现的是01背包问题 具体实现方法是用c完成滴-This code is a 01 knapsack problem of the specific method is used to achieve complete drop c
01bagpack
- 01背包问题的回溯解法 希望给大家一点帮助-01 knapsack problem the solution back to help give us some hope
Bag0_1
- 01背包 用C++编写的,还需大家指点 呵呵呆-01bag
01bag
- 使用动态规划方法解决01背包问题 比较简单的程序 -Using dynamic programming solution to 01 knapsack problem relatively simple procedure