搜索资源列表
stamp
- 连续邮资问题,采用分支限界法编写,java实现
shortest-way-java.rar
- 分支限界法 单源最短路径问题的 JAVA实现 3个源文件,Branch and bound method single-source shortest path problem JAVA realization of 3 source files
Knapsack
- 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code
main
- 分支限界法实现旅行售货员问题,使用时间挺短的,代码可读性强-Branch and bound to achieve the traveling salesman problem, the use of time very short, readable code
0_1Knasack
- 比较了求解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.
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
BBClique.java
- 分支限界算法求最大团问题,java源码,分支限界法的一个经典问题解决。(A branch and limit method for solving the problem of the maximum mass)