搜索资源列表
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
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
- knapsack，用动态规划解背包问题，可直接在eclipse上运行。-knapsack, knapsack problem using dynamic programming solution can be directly run in eclipse.
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
Knapsack
- 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code
beibaobeibao
- 这是一个0/1背包问题的解决，有图形界面，是一次软件实习作业 -This is a 0/1 knapsack problem solving, graphics interface, the software is a practical operation
Knapsack
- 经典的背包问题用回朔法实现的JAVA代码-Knapsack problem with the classic method of retrospective JAVA code
Knapsack
- java实现0/1背包问题，算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.
knapsack
- 背包问题算法 - 贪心法，递归法和动态规划法分别解决-Three solutions to Knapsack problem: the integer knapsack problem solution, fractional knapsack solution and DDG solution
Bag
- 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
Knapsack
- 0/1背包问题，java差分进化算法实验-0/1 knapsack problem, java experimental differential evolution algorithm
Knapsack
- 包含3个文件，背包问题，旅行商问题，最优BST，都是java编写的。-File have three parts .They are bag problem,knapsack problem and OptimalBST.
Knapsack
- 0-1背包问题 此算法包含了输入界面，可以随意设置货物的数量和价值。-0-1 knapsack problem algorithm includes the input interface, the number and value of the goods can be arbitrarily set.
solution-of-knapsack-problem
- 回溯法、分支限界法的原理，并能够按其原理编程实现解决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
Knapsack
- 用java实现的01背包问题的有分支限界的回溯算法，注释非常详细，是我作业的一部分。伪代码可以参考《计算机算法与数据结构》这本书-Using java to achieve 01 knapsack problem branch-and-bound backtracking algorithm and very detailed notes, is part of my job. The pseudo-code can refer to this book of computer algorith
Knapsack
- 使用Java编程，采用回溯算法来解决0-1背包问题。-Using the Java programming using backtracking algorithm to solve 0-1 knapsack problem.
Knapsack-Problem
- 求解背包问题 从根目录下的systemconfig.ini文件获取数据 结果以图表方式显示-To solve the knapsack problem Get data from systemconfig.ini at root directory Results display in graph
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