搜索资源列表
fenzhidingjie beibao
- 分支定界的0/1背包问题-branch delimitation of the 0 / 1 knapsack problem
beibao
- 0-1背包问题（0-1 Knapsack Problem）的定义为：设集合 代表m件物品,正整数 分别表示第 件物品的价值与重量，那么0-1背包问题KNAP(A,c)定义为,求A的子集，使得重量之和小于背包的容量c，并使得价值和最大。
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
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
- 采用遗传算法解决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.
beibao
- 背包问题！给定几个不同的载重物体，以及利润！得出最优解。-Knapsack problem! For a given load several different objects, and profit! Reached the optimal solution.
beibao
- 解决背包问题，使用贪心算法，源代码。使用C语言，调试通过-Solve the knapsack problem, use the greedy algorithm, the source code. Using C language, debugging through
beibao
- 0-1背包问题：给定n种物品和一个背包，物品i的重量是Wi，物品i价值为Vi，背包的容量为C。应如何选择装入背包的物品，使得装入背包中物品的总价值最大? 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包为1或不装入背包为0。不能将物品i装入背包多次，也不能只装入部分的物品i。0-1背包问题的主要特点是在选择物品i装入背包时，每种物品仅有一件，可以选择放或不放-0-1 knapsack problem: Given n types of items and a backpack, th