搜索资源列表
园排列问题
- 分支限界法解圆排列问题，是一个算法设计与分析课程的作业-branch and bound method for solving problems with a round of one algorithm design and analysis of the operational programs
优先队列式分支限界法园排列问题
- 优先队列式分支限界法园排列问题，是一个作业，算法设计与分析-priority queue-branch and bound with France Park, is an operation, algorithm design and analysis
HuoLangDanProblem
- 分支限界法实现货郎担问题，开发工具eclipse-branch and bound Method traveling salesman problem, development tools eclipse
shouhuoyuan_fenzhixianjiehehuosufa
- 在vc++平台下，用分支限界法和回溯法实现的旅行售货员问题。经本人测试运行无误，包括运行文档。
分支限界法_批处理作业调度
- 算法设计中的分支限界法中的批处理作业调度问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of batch job scheduling problem is true, VC + + prepared
解旅行售货员问题的优先队列式分支限界法
- 解决旅行售货员问题的优先队列式分支限界法C++源程序
zuidatuan.rar
- 使用优先队列分支限界法对单源最短路径问题求解，最小堆作为优先队列的存储结构 使用最小堆来存储活结点，解空间树是一个子集树,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 heap storage structure to store s
duanyuanzuiduan.rar
- 单源最短路径问题，分支限界法的优先队列解法，最小堆来存储活结点表，表示活结点优先队列，优先级是结点所对应的当前路长,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 priority queue, priority is the
FlowShop
- 用c++实现的批处理作业调度问题·优先队列式分支限界法·回溯法，包括Flowshop和make两个类，含有测试用的数据data-With c++ Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including Flowshop and make the two categories, containing the test data us
n_queen
- 还是用分支限界法解N皇后问题，已成功运行过。-Using branch and bound Solving N Queens, which has been run successfully over
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
game1
- 分支限界法算法作业：图形变换问题解题报告和源代码。问题描述：给定2个4×4方格阵列组成的图形A和B,每个方格颜色为黑色或白色。方格阵列中有公共边的方格称为相邻方格。图形变换问题的每一步可以交换相邻方格的颜色。试设计一个队列式分支限界算法，计算最少需要多少步变换，才能将图形A变换成图形B。-Branch and bound algorithm operation: graphics transform the issue of problem-solving reports and source
06
- 最优装载方案 成绩: 0 / 折扣: 0.8 试设计一个用队列式分支限界法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数，并将此函数用于解装载问题。 装载问题描述如下：有一批共n个集装箱要装上艘载重量为c的轮船，其中集装箱i的重量为wi 。找出一种最优装载方案，将轮船尽可能装满，即在装载体积不受限制的情况下，将尽可能重的集装箱装上轮船。 输入：第一行有2个正整数n和c。n是集装箱数，c是轮船的载重量 接下来的1行中有n个正整数，表示集装箱的重量
findH
- 用分支限界法实现n比较大时（n>100)找最优哈密顿回路。-Using branch and bound method to achieve relatively large n, when (n> 100) to find the optimal Hamiltonian circuit.
01bag
- 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
zhuangzai
- 有完整界面显示。使用分支限界法实现了装载问题。-zhangzai
NGProblem
- 有关图的NP问题代码 包括贪心算法求解 分支限界法 优化的分支限界法-NP problems solutions.
AlgorithmCode
- C++版本的各类算法源代码，包括动态规划法、分治法、贪心法、回溯法、分支限界法、概率算法-C++ source code version of the various algorithms, including dynamic programming, divide and conquer, greedy method, backtracking, branch and bound method, probability algorithm
n_queen
- 这个包裹实现的是分支限界法解决n王后问题，input.txt和output.txt分别掌管输入n和输出一种方案-This package implements a branch and bound method to solve the n queens problem, input.txt and output.txt were in charge of input and output of a program of n
王敬贤-SA16168143-第6次作业
- 使用C++平台用分支限界法解决最小重量机器设计问题?：对于给定的机器部件重量和机器部件价格，计算总价格不超过d的最小重量机器设计(Using c + + platform with branch threshold method solving the problem of minimum weight machine design: for a given weight of machine parts and machine parts price, calculate the total