搜索资源列表
beibaotanxinsuanfa
- 贪心算法,使用这一算法,解决0-1背包问题.-greedy algorithm, the algorithm used to solve 0-1 knapsack problem.
0-1背包
- 0-1背包问题算法在java语言的实现程序-0-1 knapsack problem algorithm java language in the realization process
BagZeroOne
- java语言实现动态规划求解0-1背包问题。
rrrrrrrrr
- 0-1背包问题多种解法，你也可以学习我们的-0-1 knapsack problem a variety of solution, you can also learn from our
beibaobeibao
- 这是一个0/1背包问题的解决，有图形界面，是一次软件实习作业 -This is a 0/1 knapsack problem solving, graphics interface, the software is a practical operation
newBag
- 动态规划策略实现0-1背包问题的JAVA源程序-Dynamic planning strategy for the achievement of 0-1 Knapsack Problem JAVA source code
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
Knapsack
- java实现0/1背包问题，算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.
lhl.java
- 用JAVA语言 动态规划算法解决0/1背包问题-good
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.
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
src
- java 0-1背包问题 动态算法实现 带图形界面-knapsack code
bag1
- 用动态规划法解决0/1背包问题，上传的是源码，经调试可以运行-use dymnamic Programming answer the knapsack problem
0_1Knasack
- 比较了求解0-1背包问题常用的几种算法，并用回溯法和分支限界法进行了Java编程实现，给出了文档及源码。-0-1 knapsack problem compared several commonly used algorithms, and use backtracking and branch and bound method of the Java programming, given the documentation and source code.
Knapsack
- 0/1背包问题，java差分进化算法实验-0/1 knapsack problem, java experimental differential evolution algorithm
0-1-knapsack-problem--
- 算法分析与设计（王晓东版）的0-1背包问题的改进算法的java代码实现，实现背包问题的求解-Algorithm analysis and design (Wang Xiaodong version) algorithm to improve the 0-1 knapsack problem is java code
DP-0-1
- 0-1背包动态规划,用动态规划来求解0-1背包的问题，Java程序来实现-0-1 backpack dynamic programming, dynamic programming to solve the 0-1 knapsack problem, Java program to achieve
12.8 01背包练习题
- java 动态规划之0-1背包问题代码详解，详细注释(0-1 knapsack problem dynamic programming code Xiangjie)