搜索资源列表
knap
- 分支限界求背包问题相对于贪心法等有很大的优势-fenzhi xianjie beibao
theshortestpath
- 用分支限界搜索法求解单源最短路径问题的算法-Branch and bound search method with a single-source shortest path algorithm
knapsack(five)
- 实现0-1背包问题的优先队列分支限界算法 FIFO 分支限界算法 递归法 回溯法 动态规划算法-0-1 knapsack problem to achieve the priority queue FIFO branch and bound algorithms branch and bound backtracking algorithm recursion dynamic programming algorithm
0-1-bugs-question
- 0-1背包的几种算法的C++实现，包括分支限界、回溯法、贪心算法几种算法-Several 0-1 knapsack algorithm c++ implementation, including branch limit, backtracking algorithm and greedy algorithm
branch-and-bound-method
- 利用分支限界法找出最大全1子团和最大全-1子团，内附文档说明-Use branch and bound method to find the maximum full sub-group and the largest full 1 sub-group, enclosing documentation
FeatureChoose
- 文件中是特征选择，选择的方法用的是分支限界法，并且还包涵分支限界法的PPT讲解。非常详细，结果也非常准确-File is feature selection method chosen by the branch and bound method, and also encompass branch and bound method PPT explain. Very detailed, very accurate results
86205569
- 分支限界法实现货郎担问题,开发工具eclipse()
695321
- 最小圆排列的分支限界法！ 用了很好的剪支策略很快的！()
archivewnndyb
- 分支限界法实现货郎担问题,开发工具eclipse()
38669714
- 最小圆排列的分支限界法！ 用了很好的剪支策略很快的！()
O旅行商分支限界法
- 用来解决旅行商问题 可以直接运行 很好的代码(To solve traveling salesman problem, we can run good code directly.)
BBClique.java
- 分支限界算法求最大团问题，java源码，分支限界法的一个经典问题解决。(A branch and limit method for solving the problem of the maximum mass)