搜索资源列表
0-1package
- 0-1背包问题的分支限界算法实现,有详细的函数功能说明 -0-1 knapsack problem branch and bound algorithm, a detailed descr iption of the function function
minimumweightdesign
- 计算机算法上最小重量机的回溯法和分支限界法的实现-Computer algorithm on the minimum weight machine backtracking and branch and bound method to achieve
huishufa
- 用分支限界法求界旅行商问题,用C++语言编程实现-Using branch and bound method profession traveling salesman problem, using C Language Programming
tax
- 介绍了分支限界算法,给出了流程图,伪代码,及源程序,清楚,完整-Introduce a branch and bound algorithm, gives the flow chart, pseudo code, and source code, clear and complete
algorithmDesignPPT
- 算法设计与文件的整套电子教案,主要包括递归和分治方法、动态规划算法、贪心算法、回溯法、分支限界法等常用算法和NP问题-Algorithm design and documentation package of electronic lesson plans, including recursive and sub-rule method, dynamic programming algorithm, greedy algorithms,
Branch_Bound_Knap
- 分支限界背包算法实现,用VC++6.0开发。-Branch and bound algorithm backpack with VC++ 6.0 development.
huolangdanwenti
- 货郎担问题算法和程序,包括限界算法,和分支限界图形演示,绝对能执行-Traveling salesman problem algorithms and procedures, including Bound algorithm, and branch and bound graphical presentation is absolutely able to perform
8queue
- 用分支限界法解决n皇后问题,可以输出所有的解,并分页停顿显示-Branch and bound by law to resolve the issue of n s, you can export all of the solution, and paging standstill show
cut
- 无向图的最大割:对于给定的无向图G,设计一个优先队列式分支限界法,计算G的最大割。-Undirected graph of the largest cut: For a given undirected graph G, the design of a priority queue-type branch and bound method to calculate G, the largest cut.
fenzhixianjiefa
- 文章详细讲解分支限界的基本思想,单元最短路径问题,装载问题,0-1背包问题,旅游售货员问题等。-Detailed article on the basic idea of branch and bound, the shortest path problem unit, loading issues ,0-one knapsack problem, travel salesman problem.
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档,包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
shortest-way-java
- 分支限界法 单源最短路径问题的 JAVA实现 3个源文件-Branch and bound method single-source shortest path problem JAVA realization of 3 source files
Qkw_Fac6_8
- 电路板排列问题的分支限界解法,,本程序取自王晓东编著“算法分析与设计”第 225 页,原程序不通,我调试已通过。 -Circuit board with the issue of branch and bound method, this procedure from Xiaodong edited Algorithm Analysis and Design section 225, the original procedure
Fac6_3
- //本程序取自王晓东编著“算法分析与设计”第 198 页,例 //装载问题的分支限界解法-//This procedure Xiaodong edited from the Algorithm Analysis and Design, p. 198, for example,// load the problem branch and bound method
zuidatuan
- 使用优先队列分支限界法对单源最短路径问题求解,最小堆作为优先队列的存储结构 使用最小堆来存储活结点,解空间树是一个子集树-Priority queue using branch and bound method of single-source shortest path problem solving, and the youngest heap as a priority queue to use the smallest he
duanyuanzuiduan
- 单源最短路径问题,分支限界法的优先队列解法,最小堆来存储活结点表,表示活结点优先队列,优先级是结点所对应的当前路长-Single-source shortest path problem, branch and bound method of the priority queue method, the smallest heap to store slipknot points table, said slipknot point p
che
- 问题描述:按照国际象棋的规则,车可以攻击与之处在同一行或同一列上的棋子。指南车是有方向的车。横向指南车可以攻击与之处在同一行上的棋子。纵向指南车可以攻击与之处在同一列上的棋子。指南车问题要求在m×n格的棋盘上放置指南车,并确定各指南车的攻击方向,使棋盘上不受指南车攻击的方格数最多。 编程任务:对于给定的m×n格的棋盘和2 个整数x 和y。整数x 表示棋盘上有x个规定方格应放置指南车,但攻击方向未定。整数y表示除了已规定放置位置
The_design_of_computer_algorithms
- 全书从算法设计和算法分析的基本概念和方法入手,系统介绍了算法设计方法与分析技巧。全书分为3个部分:第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析;第二部分针对排序问题和图的问题,讨论各种已有的算法,并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法,并介绍了计算的复杂性以及NP完全问题;第三部分讲述并行计算模型和并行算法设计技术。书中每章后面都附有一定数量的习题,帮助读者理解和掌握书中的内容。-Bo
fenzhixianjie
- 算法分析中,分支限界法的实现,并有完整的测试数据-Algorithm analysis, the achievement of branch and bound method, as well as complete test data
Nhuanghoujianzhi
- N皇后剪枝算法 关键字 回溯,剪枝 ,上界,下界,分支限界-N Queen pruning algorithm for keyword back, pruning, upper bound, lower bound, branch and bound