搜索资源列表
beibao1
- java 编写的背包问题，按不同的方法选择不错啊-prepared by the knapsack problem by different methods to choose good ah
beibao2
- java 编写的背包问题，按不同的方法（第二种）-prepared by the knapsack problem by different methods (second)
Algorithms
- 算法导论上机作业java实现，主要有背包问题，八皇后问题，递归等。-Introduction to the machine operation algorithm java to achieve, there are knapsack problem, the eight queen problem, recursive and so on.
Fac3_9
- //0-1背包问题动态规划解法，原自王晓东算法设计，该程序已调通-//0-1 knapsack problem dynamic programming method, the original algorithm since Xiaodong design, the program has been transferred Qualcomm
KnapsackProblem
- 0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
Knapsack
- 0-1背包 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？
KnapsackProblem
- 问题：已知有n种物品和一个可容纳M重量的背包，每种物品i的重量为wi。假定将物品i的一部分xi放入背包就会得到pixi的效益，这里，0≤xi≤1，pi>0。如果这些 物品重量的和大于M，要求所有选中要装入背包的物品总重 量不得超过M，而装入背包物品获得的总效益最大。-Question: are known to have n kinds of goods and M can hold the weight of a backpack, the weight of each item
Knapsack
- Using java language implement an 0 / 1 knapsack problem. Using the recursive algorithm.And the interface also is added.
5sourcecodes
- o-1 knapsack parallel implementaion in c, Begining socket pro in c.zip, rsa using crt in c, des in java, fuzzy string matching in c-o-1 knapsack parallel implementaion in c, Begining socket pro in c.zip, rsa using crt in c, des in java,
algorithm_report
- 算法分析与设计报告，用java编写的4个常见的算法小程序。包括矩阵相乘问题，0/1背包问题，删数问题，和旅行商问题。-Algorithm analysis and design reports using java prepared four common algorithm applet. Including matrix multiplication problem, 0/1 knapsack problem, delete a few problems, and traveling sal
Java
- 骑士走棋盘、八个皇后、八枚银币、生命游戏、字串核对、双色、三色河内塔、背包问题-Knight walking the board, eight queens, eight silver, Game of Life, string matching, two-, three-color Hanoi Tower, knapsack problem, etc.
BagZeroOne
- 用java实现0/1背包问题 贪心算法-the knapsack of using java
KGaBinnn
- 遗传算法解决复杂背包问题，用Java编写。该背包拥有3个属性，500个东西，50个包包。求解包与包之间物品重量差最小，并且同一个背包的物品属性有特殊要求。该程序容易修改。 -Genetic algorithms to solve complex knapsack problem, written in Java. The backpack has three properties, 500 things, 50 bags. Solving package and package goods
GeneticAlgorithm
- 遗传算法解决背包问题和旅行商问题。 测试数据已经写入java代码中。 遗传算法的参数可以修改。-Genetic algorithm to solve the knapsack problem and the traveling salesman problem. The test data has been written to the java code. The parameters of the genetic algorithm can be modified.
duoxiangshi
- 这个是背包问题，是java中算法设计的一个重要内容-This knapsack problem is an important content of java algorithm design
BackpackTH(1)
- 退火算法实现0/1背包问题求解，java编写，eclipse中编写，工程文件齐全，界面清楚，运行结果正确-Annealing algorithm to achieve the 0/1 knapsack problem solving, writing java eclipse write engineering documents, clear interface, the results are correct
Knapsack
- 01背包问题的java实现，使用了树结构，比较器-Java 01 knapsack problem of implementation, using a tree structure, the comparator
贪心算法-局部背包
- 使用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.)