搜索资源列表
0-1
- 分支限界法 0/1背包问题 程序 分支限界法 0/1背包问题 程序
game1
- 分支限界法算法作业：图形变换问题解题报告和源代码。问题描述：给定2个4×4方格阵列组成的图形A和B,每个方格颜色为黑色或白色。方格阵列中有公共边的方格称为相邻方格。图形变换问题的每一步可以交换相邻方格的颜色。试设计一个队列式分支限界算法，计算最少需要多少步变换，才能将图形A变换成图形B。-Branch and bound algorithm operation: graphics transform the issue of problem-solving reports and source
FriendGame
- 七彩连珠游戏，分支限界算法实现，简单易用，不是GDI+编程，界面过于简单-Game
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
backpackbranchandbound
- 这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm
a
- 用分支限界方法求解最淡哈密顿回路，可以球接到30以上-Using branch and bound method for solving the most light Hamiltonian circuit, you can receive the ball for more than 30
fzjx
- 货郎担问题的分支限界算法，速度很快，并且结点可以到达35个-The branch and bound algorithm for traveling salesman problem, very fast, and the node can reach 35
01bag
- 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
tsp
- tsp问题高效代码，程序为c语言编写，算法为分支限界。-tsp issue of efficient code, the program for the c language
ctest
- 推箱子状态空间搜索,慢慢研究吧。分支限界法，采用优先队列实现-tuixiangzi
0-1bag
- 实现0—1背包问题的分支限界搜索，为控制台应用程序，编译环境为vs2008-0-1 knapsack problem to achieve the branch and bound search for the console application, compile environment for vs2008
limit
- 用C实现了分支限界算法，读者可以运行该程序理解分支限界算法-Achieved with the C branch and bound algorithm, readers can run the program understand the branch and bound algorithm for
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
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
traveller
- 本程序是算法设计的经典问题，采用分支限界发解决旅行商问题-This program is a classic algorithm design problem, using branch and bound fat Traveling Salesman Problem
knap
- 分支限界求背包问题相对于贪心法等有很大的优势-fenzhi xianjie beibao
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