搜索资源列表
-
0下载：
贪心算法,使用这一算法,解决0-1背包问题.-greedy algorithm, the algorithm used to solve 0-1 knapsack problem.
-
-
0下载：
0-1背包问题算法在java语言的实现程序-0-1 knapsack problem algorithm java language in the realization process
-
-
0下载：
0-1背包问题多种解法，你也可以学习我们的-0-1 knapsack problem a variety of solution, you can also learn from our
-
-
0下载：
这是一个0/1背包问题的解决，有图形界面，是一次软件实习作业
-This is a 0/1 knapsack problem solving, graphics interface, the software is a practical operation
-
-
0下载：
动态规划策略实现0-1背包问题的JAVA源程序-Dynamic planning strategy for the achievement of 0-1 Knapsack Problem JAVA source code
-
-
0下载：
课程设计时我们的0-1背包问题，大家需要的-Curriculum design of our 0-1 knapsack problem, we need to
-
-
0下载：
需要的0-1背包问题的解，课程设计时的必须-Required the solution of 0-1 knapsack problem, curriculum design must be
-
-
0下载：
java实现0/1背包问题，算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.
-
-
0下载：
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下载：
本程序是用Java语言编程，实现求解0/1背包问题-The program is Java language programming, for solving 0/1 knapsack problem
-
-
0下载：
比较了求解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.
-
-
0下载：
0/1背包问题，java差分进化算法实验-0/1 knapsack problem, java experimental differential evolution algorithm
-
-
0下载：
0-1背包问题java算法及实现，使用java图形界面-0-1 knapsack problem java algorithm and implementation, the use of java GUI
-
-
0下载：
用java 实现 动态规划求0-1背包问题两个实例 包括改进后的算法实现-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
-
-
0下载：
0-1背包问题 此算法包含了输入界面，可以随意设置货物的数量和价值。-0-1 knapsack problem algorithm includes the input interface, the number and value of the goods can be arbitrarily set.
-
-
0下载：
回溯法、分支限界法的原理，并能够按其原理编程实现解决0-1背包问题，以加深对回溯法、分支限界法的理解。 -Backtracking, branch and bound method principle, and can according to the principle of programming to realize solving knapsack problem, in order to deepen our understanding of the backtracking, bra
-
-
0下载：
使用Java编程，采用回溯算法来解决0-1背包问题。-Using the Java programming using backtracking algorithm to solve 0-1 knapsack problem.
-
-
0下载：
0-1背包问题，空间点对问题，图形压缩，线性时间选择以及最优二叉树的java脚本程序-0-1 knapsack problem, the point of the problem space, image compression, linear time optimal tree selection and java scr ipt program
-
-
0下载：
算法分析与设计（王晓东版）的0-1背包问题的改进算法的java代码实现，实现背包问题的求解-Algorithm analysis and design (Wang Xiaodong version) algorithm to improve the 0-1 knapsack problem is java code
-
-
0下载：
0-1背包动态规划,用动态规划来求解0-1背包的问题，Java程序来实现-0-1 backpack dynamic programming, dynamic programming to solve the 0-1 knapsack problem, Java program to achieve
-
