搜索资源列表
suanfa
- 分支限界法解决01背包问题，适用于算法上机作业-Branch and bound method to solve the 01 knapsack problem
0-1cc
- 0-1背包问题-分支限界法,算法设计课程作业-0-1 knapsack problem- branch and bound algorithm design course work
fzxj
- 分支限界法解决单源最短路径问题(xiaodan)-Branch and bound method to solve the single source shortest path problem (xiaodan)
The-algorithm-analysis-and-design
- 研究生上课所用的算法分析与设计相关文档PPT，分八个章节对算法进行详细介绍： 第1章 算法引论 第2章 递归与分治策略 第3章 动态规划 第4章 贪心算法 第5章 回溯法 第6章 分支限界法 第7章 概率算法 第8章 NP完全性理论 -Graduate classes used in algorithm analysis and design documents the PPT is divided
clique
- 最大团问题 回溯法 分支限界法 绝对给力 -the largest group huisu fenzhixianjie
shortestPath
- 用Java语言实现的用分支限界法解决单源最短路径问题的算法-An implementation of single source shortest path problem with Java language based on branch and bound method
Wiring
- 分支限界法实现布线问题，C++实现，可直接运行-A realization of wiring
buxianwenti-
- 布线问题（分支限界），说明太短了，这叫做言简意赅，懂吗你？-wiring problem
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 understa
fenzhixianjie
- 分支限界法实现0-1背包问题源代码测试通过-Source code testing by branch and bound 0-1 knapsack problem
ChTSP
- 分支限界算法求解TSP问题，还不错，可以下载-Branch-and-bound algorithm for TSP, well, you can download to see
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
buxianwenti
- 实验要求：请在下图所给出电路板中，按布线要求，利用队列式或优先队列分支限界法实现从a到b的布线工作 -Experimental requirements: On the graph below given circuit board, wiring requirements, queue or priority queue branch and bound method to achieve the wiring from a to
Eight-puzzle
- 八数码难题-两种不同的分支限界法解决 input.txt中为起始的状态，output.txt\output2.txt为两种不同解法的输出-Eight digital problem- two different branch and bound method for solving input.txt initial state, output.txt \ output2.txt solution for the two diffe
Branch-threshold-method
- 运用分支限界法解布线问题。Branch threshold method wiring-Branch threshold method wiring
6d2
- 王晓东《算法设计与分析》第六章第二节分支限界法求单源最短路劲问题源代码-Xiaodong " algorithm design and analysis" section 6.2 branch and bound method for single-source shortest path problem Energizer source code
6d3-1
- 王晓东《算法设计与分析》第六章第三节装载问题队列式分支限界法求解-Xiaodong " algorithm design and analysis," Chapter III loading problems queue-style branch and bound method to solve
6d3-2
- 王晓东《算法设计与分析》第三节装载问题优先队列式分支限界法求解-Xiaodong " algorithm design and analysis" problem loading priority queue type III branch and bound method to solve
6d4
- 王晓东《算法设计与分析》第六章第四节布线问题队列式分支限界法求解-Xiaodong " algorithm design and analysis," Chapter IV wiring problems queue-style branch and bound method to solve
6d5
- 王晓东《算法设计与分析》第六章第五节0-1背包问题分支限界法求解-Xiaodong " algorithm design and analysis," Chapter V 0-1 knapsack problem branch and bound method to solve