搜索资源列表
fenzhidingjie beibao
- 分支定界的0/1背包问题-branch delimitation of the 0 / 1 knapsack problem
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
- 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
- 用动态规划 实现了背包算法 结果还不错 -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
- 采用遗传算法解决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
- 解决背包问题，使用贪心算法，源代码。使用C语言，调试通过-Solve the knapsack problem, use the greedy algorithm, the source code. Using C language, debugging through
beibao.doc.tar
- 程序算法，动态规划，背包问题。。。供学习动态规划。-Program algorithm, dynamic programming, knapsack problem. . . For learning dynamic programming.
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
beibao
- 背包问题的动态规划求解采用一维数组求解 结构体数组-Knapsack problem solved using dynamic programming for solving one-dimensional array of array of structures
BeiBao
- 遗传算法解决背包问题，代码功力深厚。 更个王振的东西。很好-Genetic algorithm to solve knapsack problem, the code profound skill.
beibao--wenti
- 背包问题，百度文库上下载的，代码有点长，你懂得-Knapsack problem, Baidu download library, code a bit long, you know
beibao
- 背包问题的资料，相对比较全了，可以入门学习用。-Knapsack problem of information, relatively wide, and can be started learning to use.
beibao
- 用动态规划的方法解0/1背包问题。用VC6编译运行正确。供参考-Using dynamic programming for solving 0/1 knapsack problem. Compile and run correctly with VC6. Reference
beibao
- 用贪心法解决背包问题：设有不同价值、不同重量的物品n件，求从这n件物品中选取一部分物品的方案， 使选中的物品的总重量不超过指定的限制重量，但选中物品的价值之和最大。-Knapsack problem with a greedy method to solve: with different values, different weights of items n pieces, find items from n items in the select part of the program