搜索资源列表
optimal-decision
- 最优决策——用几个matlab编程的实例阐述分支定界法的思想是：首先确定目标值的上下界-Optimal decision-making- matlab programming with some examples of the branch and bound method is the idea: First, determine the target of the upper and lower bounds
750
- A branch-and-bound algorithm for asymmetric TSP
d_function
- 分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes.
branch-and-cut-algorithm
- 分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。-Branch and cut is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to int
TSP_BranchAndBound
- Solving the TSP problem using the Branch and Bound Algorithm
main
- 作業系統RR排程方法,使用c程式來表示cpu bound & io bound (學校作業)-RR operating system scheduling methods, the use of c program to that cpu bound & io bound (school work)
BranchBound
- 算法作业，采用分支定界算法，求解最小路径问题-Algorithm operations, branch and bound algorithm for solving the minimum path problem
BNB20
- branch-and-bound-tree algotihm for optimization
BABA
- TSP问题的求解，分支限界，利用分支限界求TSP问题-TSP Soulution using branch and bound
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
IntProgFZ
- 利用分支定界法求解整数规划问题，结果精确-Using branch and bound method to solve integer programming problems, the results of precise ~~~~~
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
CRB_final
- This the CRB caculated for an OFDM system to compair belind channel estimation. CRB is Cramer Rao bound and it is the lowest bound for analyzing the devlopement of algorithms of channel estimation. -This is the CRB cac
submission.tar
- Branch and bound is one of the best complete. algorithms for the tsp decision problem
wtsf.tgz
- N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic program
TSP
- this a branch and bound code for TSP-this is a branch and bound code for TSP
matlabmiaoshu
- 分支定界法的matlab描述，其中有具体的代码信息 -Branch and bound method described in matlab
metody
- branch and bound tsp
Desktop
- 实验四：分枝限界算法设计 实现课本上旅行售货员问题的分枝限界算法(P225)，随机生成两个规模为10和20的TSP实例，比较算法运行时间。 提交源代码以及实验报告。 -Experiment 4: Design and Implementation of Branch and Bound algorithm for the traveling salesman problem textbooks Branch and Boun