当前位置:
首页
资源下载

搜索资源 - knapsack problem for java
搜索资源列表
-
0下载:
动态规划策略实现0-1背包问题的JAVA源程序-Dynamic planning strategy for the achievement of 0-1 Knapsack Problem JAVA source code
-
-
0下载:
一些很经典的算法!!!包括八皇后问题和背包问题,排列组合问题和数字拆分问题等.-Algorithm for some very classic! ! ! Including the eight queens problem and the knapsack problem, permutation and combination problems and digital split issues.
-
-
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下载:
jcreator下写的背包问题,适合JAVA入门。给定背包的容量,在输入的物品中,求出符合条件的解,如果不存在解,则输出不存在-jcreator written under the knapsack problem, for JAVA entry. Given knapsack capacity, in input items, find qualified solution, if there is no solution, the output does not exist
-
-
0下载:
老师给的用Java编写的算法,包括背包问题,
回溯法等等,适合有基础的学习。-Teacher' s use of algorithms written in Java, including the knapsack problem, backtracking, etc., suitable for basic learning.
-
-
0下载:
本程序是用Java语言编程,实现求解0/1背包问题-The program is Java language programming, for solving 0/1 knapsack problem
-
-
0下载:
使用java语言实现贪心算法中的局部背包问题,适合正在学习这方面算法的人使用。(The Java language is used to implement the local knapsack problem in the greedy algorithm, which is suitable for people who are learning this algorithm.)
-