文件名称:0-1-Knapsack-problem
介绍说明--下载内容均来自于网络,请自行研究使用
本次实验选择0-1背包问题作为题目,通过使用动态规划、回溯法和分支定界法等算法来求解该问题,从而进一步的了解各种算法的原理、思路及其本质,深化对算法的了解,锻炼自己对各种算法的分析和使用,熟悉软件底层算法和界面编程。-The 0-1 knapsack problem was chosen as the subject, through the use of dynamic programming, backtracking and branch and bound method algorithm to solve the problem, so as to further the understanding of the principles of various algorithms, ideas and nature, deepening of the algorithm Learn to exercise their own analysis of the various algorithms and use familiar with the software underlying algorithms and programming interface.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
源文件\BackProblemArithmetic.java
......\BBKnapsack.java
......\BBnode.java
......\BPJ.java
......\ElemComparator.java
......\Element.java
......\HeapComparator.java
......\HeapNode.java
......\Knapsack.java
......\m.java
......\m1.java
......\MaxHeap.java
0-1背包问题.doc
源文件