搜索资源列表
travelling_saleman
- 经典算法：旅行商算法，采用爬上法和分支界限搜索-classical algorithm : traveling salesman algorithm, used to climb up and branch Boundary Search
travelling_saleman
- 经典算法：旅行商算法，采用爬上法和分支界限搜索-classical algorithm : traveling salesman algorithm, used to climb up and branch Boundary Search
Computer-algorithm-designanswer-
- 计算机算法设计，递归与分治策略，动态规划，贪心算法，回朔法，分支界限法，线性规划与网络流，NP完全问题与近似算法等-Computer algorithms, recursive and the strategy of divide and conquer, dynamic programming, greedy algorithms, backtracking method, branch and bound method, linea
yundongyuan
- 这是在大二学习算法分析时写的关于分支界限法，运动员最佳配对问题。-This is a write the sophomore learning algorithm analysis on the branch and bound method, the best athletes pairing problems.
0-1
- 我自己用C写的一个用分支界限法实现0-1背包问题，比较简便实用，而且易懂，比回溯法有明显的优势-I have written in C, a branch and bound method 0-1 knapsack problem is relatively simple and practical, and easy to understand, there are obvious advantages than backtracki
MaxClique
- 分支界限法解决最大团问题，编译通过，代码正确-Branch and bound method to solve the maximum clique problem, compiled through the correct code
0-1packets
- 一个算法的实现：使用分支界限法求解0-1背包问题-The realization of an algorithm: 0-1 knapsack problem using the branch and bound method
IntProgFZ
- 分支界限法求解整数规划，matlab 分支界限法求解整数规划，matlab-branch and cut with matlab
ZeroOnePack
- 分支界限法求解0-1背包问题。有N件物品和一个容量为V的背包，第i件物品的费用是c[i]，价值是w[i]，求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。-Branch and bound method for solving 0-1 knapsack problem. N items and a capacity V of the backpack, the cost of items i C [i], t
The-TSP-problem
- The TSP problem - 旅行商问题，回溯，分支界限法解决-The TSP problem- traveling salesman problem, backtracking, branch-and-bound method to solve
fenzhijiexifa
- 队列式分支界限法解决的最优装载问题，STL-Queue-type branch and bound method to solve the problem of the optimal loading
nHuangHou
- 队列式分支界限法实现的n皇后问题，采用文件的方式输入输出-Queue-type branch and bound method to achieve the n-queens problem, using the method of file input and output
WorkAssignments
- 工作分配问题，采用分支界限法实现，希望有所帮助-work assignments
0-1bag
- 运用贪心算法解决0-1背包问题； 运用回溯法解决0-1背包问题； 运用分支界限法解决0-1背包问题。 -Use greedy algorithm to solve 0-1 knapsack problem Use backtracking to solve the 0-1 knapsack problem Using the branch and bound method to solve the 0-1 kna
sousuosuanfa
- 搜索算法. 实现基于树的基本搜索算法(BFS)的哈密顿环. 实现基于树的基本搜索算法(DFS)的哈密顿环. 实现基于爬山法的的哈密顿环. 利用分支界限算法实现最小哈密顿环. -Search algorithm. To achieve the basic algorithm tree search (BFS) Hamiltonian ring. Implement basic search algorithm
算法大作业
- 算法实现，用C++语言来分支界限法处理批处理问题(Algorithm, batch processing method using C++ language to branch and bound)
QJOCPBC
- 用分支界限法实现的n后问题 vc++ 语言效率很好()
DZIITW
- 用分支界限法实现的n后问题 vc++ 语言效率很好()
Chapter9
- 用分支界限法来解决0-1背包问题，包含算法分析(Branch and bound method for solving 0-1 knapsack problem)