搜索资源列表
beibaotanxinsuanfa
- 贪心算法,使用这一算法,解决0-1背包问题.-greedy algorithm, the algorithm used to solve 0-1 knapsack problem.
Knapsack21
- 背包问题(java)一个用JAVA 实现的背包问题，P，W，M自己输入-knapsack problem (java) JAVA with a backpack, P, W, M own input
beibaowentia
- 该源码转自于其它网站， 背包问题-switched from the source to other sites, Knapsack Problem
0-1背包
- 0-1背包问题算法在java语言的实现程序-0-1 knapsack problem algorithm java language in the realization process
实验报告-背包
- 关于背包问题的基本思想运行结果测试平台源码-knapsack problem on the basic idea of running results Source Testing Platform
Knapsack-problem
- 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。-Suppose a total volume of T can be packed into a backpack and n pieces of volume, respectively w1, w2, ..., wn items, items can be selected from n nu
rrrrrrrrr
- 0-1背包问题多种解法，你也可以学习我们的-0-1 knapsack problem a variety of solution, you can also learn from our
pacel
- 经典问题----背包问题的java源代码，求解-Knapsack problem---- the classic problem of the java source code, to solve
newBag
- 动态规划策略实现0-1背包问题的JAVA源程序-Dynamic planning strategy for the achievement of 0-1 Knapsack Problem JAVA source code
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
TestKnapsack
- 经典的背包问题用动态规划实现的JAVA代码-Classical knapsack problem using dynamic programming to achieve the JAVA code
tanxin
- 经典的背包问题用贪心法实现的JAVA代码-Classical knapsack problem greedy method using the JAVA code
T
- 基于Java的背包问题，根据最优值求出最优解。-Java-based knapsack problem, according to derive the optimal value of the optimal solution.
rdthe
- 课程设计时我们的0-1背包问题，大家需要的-Curriculum design of our 0-1 knapsack problem, we need to
ddgg
- 需要的0-1背包问题的解，课程设计时的必须-Required the solution of 0-1 knapsack problem, curriculum design must be
Java
- 一些很经典的算法！！！包括八皇后问题和背包问题，排列组合问题和数字拆分问题等.-Algorithm for some very classic! ! ! Including the eight queens problem and the knapsack problem, permutation and combination problems and digital split issues.
Arithmetic
- 用JAVA完成的0-1背包算法，一共用了四种算法，包括贪心，分治，动态规划，回溯。把工程导入ECLIPSE下就可以了。-JAVA finished 0-1 with a knapsack algorithm, a share of the four algorithms, including greedy, divide and conquer, dynamic programming, backtracking. To work on it under into ECLIPSE.
java
- 老师给的用Java编写的算法，包括背包问题， 回溯法等等，适合有基础的学习。-Teacher' s use of algorithms written in Java, including the knapsack problem, backtracking, etc., suitable for basic learning.
a
- 0—1背包问题描述如下： 给定m种物品和一背包。物品i的重量是w[i]，其价值为v[i]，背包的容量是c，问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。(每种物品只能选择放入0/1次背包）-0-1 knapsack problem described as follows: given m types of items and a backpack. Item i of the weight of w [i], a value of v [i], the capacity
0_1knaps
- 本程序是用Java语言编程，实现求解0/1背包问题-The program is Java language programming, for solving 0/1 knapsack problem