搜索资源列表
最大团问题的各种算法和源代码
- 最大团问题(Maximum Clique Problem, MCP)是图论中一个经典的组合优化问题,也是一类NP完全问题,在国际上已有广泛的研究,而国内对MCP问题的研究则还处于起步阶段,因此,研究最大团问题具有较高的理论价值和现实意义。 最大团问题又称为最大独立集问题(Maximum Independent Set Problem),在市场分析、方案选择、信号传输、计算机视觉、故障诊断等领域具有非常广泛的应用。目前,求解MCP问题的
园排列问题
- 分支限界法解圆排列问题,是一个算法设计与分析课程的作业-branch and bound method for solving problems with a round of one algorithm design and analysis of the operational programs
sufashejia
- 不错的算法设计与分析的课件 ,主要介绍各种算法 ,很不错的.-good algorithm design and analysis of the courseware, introducing the various algorithms, very good.
shouhuoyuan_fenzhixianjiehehuosufa
- 在vc++平台下,用分支限界法和回溯法实现的旅行售货员问题。经本人测试运行无误,包括运行文档。-In vc++ Platform, using branch and bound and backtracking realize the travel salesman problem. After I run the correct tests, including the operation of the document.
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 categorie
bag
- 分支限界法解决0/1背包问题,用c++的优先队列方法-Branch and bound method to solve 0/1 knapsack problem, using c++ Priority queue method
0-1
- 分支限界法 0/1背包问题 程序 分支限界法 0/1背包问题 程序
game1
- 分支限界法算法作业:图形变换问题解题报告和源代码。问题描述:给定2个4×4方格阵列组成的图形A和B,每个方格颜色为黑色或白色。方格阵列中有公共边的方格称为相邻方格。图形变换问题的每一步可以交换相邻方格的颜色。试设计一个队列式分支限界算法,计算最少需要多少步变换,才能将图形A变换成图形B。-Branch and bound algorithm operation: graphics transform the issue of probl
Knapsack
- 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code
FenziJieding
- 分支限界法类似于回溯法,也是一种在问题的解空间树T上搜索问题解的算法-Branch and bound method is similar to retroactive law, is also a solution in the problem search space tree T on the issue of solution algorithm
ctest
- 推箱子状态空间搜索,慢慢研究吧。分支限界法,采用优先队列实现-tuixiangzi
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 algorit
TSP
- 这是用Delphi编写的程序,目的是用TSP(分支限界法)实现旅行商问题-This is a program written with Delphi, the purpose is to use TSP (branch and bound method) to achieve the traveling salesman problem
0-1knapsackBranchBound
- 0-1 背包 分支限界法(0-1knapsackBranch&Bound) vc-0-1knapsackBranch&Bound
BBShortest
- 用分支限界法实现单源最短路径 用分支限界法的思想-Branch and bound method with single-source shortest path with the idea of branch and bound
lvxingshouhuoyuan
- 旅行售货员问题的java版本,采用分支限界法。有详细解释-Traveling salesman problem is the java version, using branch and bound. Explained in detail
push
- 算法推箱子问题,对于给定的仓库布局,以及仓库管理员在仓库中的位置和箱子的开始位置和目标位置, 设计一个解推箱子问题的分支限界法, 计算出仓库管理员将箱子从开始位置推到目标位置所 需的最少推动次数。-push problem
arrange_of_circle
- 用分支限界法和回溯法进行圆排列,是算法中的经典问题,两个程序都能进行文件的读取和写入,是非常好用的程序。-Using branch and bound and backtracking method round arrangement, is a classic problem algorithm, the two programs can read and write to files is very easy to use prog