搜索资源列表
beibao
- 背包问题运用贪婪算法的matlab 程序实现
01beibao.rar
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！,01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
beibao
- 背包问题，可以解决最短路径问题，或优化问题-Knapsack problem, the shortest path problem can be solved, or optimization problems
beibao
- 通过贪心算法实现背包问题，可实现小规模背包问题-Through the greedy algorithm knapsack problem, enabling small-scale knapsack problem
beibao
- 实现背包问题，可以直接运行！！！！欢迎下载-Knapsack problem to achieve, you can directly run! ! ! ! Welcome to download
beibao
- 0-1背包问题:输入两个整数n和m,从数列1，2，3....n中随意取几个数，使得其和等于m，求所有组合-0-1 knapsack problem: Enter the two integers n and m, from a series of 1,2,3 .... n grab a few numbers and make it equal to m, for all combinations
beibao
- 经典的背包问题，用C++语言，可以自行设定背包数和限重，值得参考哦-Classic knapsack problem, using C++ Language, can be set and limit the number of heavy backpack, it is also useful Oh
Beibao-JAVA
- 提供一个用Java实现背包问题的解法，如果有必要可以自行修改相关参数后再做仿真-Used to provide a Java implementation of the solution of knapsack problem and, if necessary modify the relevant parameters can then make simulation
beibao
- 用动态规划 实现了背包算法 结果还不错 -Knapsack algorithm achieved good results
beibaozhongyao
- 01背包问题是重要的问题，需要解决。C++解决该问题的方式易懂简介。-beibao
beibao
- 对几种背包问的分析与解释，主要包干，0/1背包问题，完全背包问题-failed to translate
beibao
- 数据结构算法背包问题解法之递归解法，C语言实现 -Data structure algorithm of knapsack problem Recursive Solution Method, C language
beibao
- 此代码实现的是01背包问题 具体实现方法是用c完成滴-This code is a 01 knapsack problem of the specific method is used to achieve complete drop c
beibao
- 背包问题的一种解决方法，上传一下，给大家一些参考-Knapsack problem as a solution, click upload, give us some reference
beibao
- 贪心法求解背包问题，希望对大家有帮助，还 的的的 -Knapsack problem greedy method, we would like to help, but also of the
beibao
- 一个基于c++环境利用背包法求最优解的算法，-Based on c++ environment using the optimal solution method backpack algorithms,
traceback1
- c# 0-1背包 穷举法，绝对正确，已经通过测试。-this is beibao。it s very good,trust me!
beibaoVC6
- VC6实现背包问题，内容详实，易懂，非常适合初学者-VC——beibao
beibao
- 采用遗传算法解决0-1背包问题，即装入物体容量有限，每个物体有不同价值，使得最终价值最高-Using genetic algorithm to solve the 0-1 knapsack problem, that is, limited capacity into objects, each object has a different value, making the final value of the maximum
beibao
- 背包问题的完整实现。经常在大公司笔试时会遇到，多看看。-The full realization of knapsack problem. Large companies often encounter when written, and read more.