搜索资源列表
分支限界算法求解TSP问题
- 本程序用分支界限方法解决TSP问题,即旅行商问题.-the procedures used branch line solution to TSP, the traveling salesman problem.
布线问题(分支限界算法应用)
- 六 程序实现: #include <stdio.h> typedef struct { int row int col }Position int FindPath (Position start, Position finish, int &PathLen, Position *&path) { //计算从起始位置start到目标位置finish的最短布线路径,找到返回1,否则,返回0 int i if ((start.row =
园排列问题
- 分支限界法解圆排列问题,是一个算法设计与分析课程的作业-branch and bound method for solving problems with a round of one algorithm design and analysis of the operational programs
分支界限
- 用vc编写的解决计算机算法中的分支限界问题,非常经典的代码,请多多指教!-vc prepared with the computer algorithm to solve the branch and bound, very classic code, a great weekend!
分支界限法求单源最短路径
- 计算机算法与设计第三版,分支限界法单源最短路径程序,换成.cpp就能直接使用。
branchandbound
- 分支限界这一章的课件,经典空间,大家交流呀-Branch and bound this chapter courseware, classic space, we exchange it
findH
- 用分支限界法实现n比较大时(n>100)找最优哈密顿回路。-Using branch and bound method to achieve relatively large n, when (n> 100) to find the optimal Hamiltonian circuit.
fenzhixianjie_zuiyouzhuangzai
- 使用分支限界算法解决最优装载问题,是算法分析与设计的经典。-Using the branch and bound algorithm to solve the optimal loading problem is a classic algorithm analysis and design.
algorithm_report
- 算法设计报告5个重要算法,包括贪心,回溯,动态规划,分支限界,分治法,每种算法介绍及实例问题代码,C++成功编译运行-Algorithem report including 5 Major algorithms
zhuangzai
- 有完整界面显示。使用分支限界法实现了装载问题。-zhangzai
bags
- 四种算法(动态规划、回溯法、分支限界法、贪心法)实现0-1背包问题-four algorithms including dynamic planningm,tracing,branch and bound method and greedy to implement 0-1 bag problem.
C
- 利用分支限界算法求解最优装载,实现了最优装载问题的求解-The use of branch and bound algorithm to solve the optimal load to achieve the optimal load for solving the problem
jingdiansuanfa
- 经典算法+分支限界法+分治法+动态规划+贪心算法+回溯法-Classical branch and bound algorithm+ France+ divide and conquer dynamic programming+++ backtracking greedy algorithm
nqueens
- 分支限界法解决皇后问题,在nxn棋盘上放n个棋子,要求两个棋子不能放在同一列上-Queens branch and bound method to solve the problem, put the board in the nxn n-piece, two pieces can not be requested on the same column
fenzhijiexian
- 1.分支界限算法背包问题 2.算法之分支限界法的旅行售货员问题-1. Branch and bound algorithm for knapsack problem 2. Branch and bound algorithm for the traveling salesman problem
upload
- 羽毛球队有男女运动员各n 人。给定2 个n×n 矩阵P 和Q。P[i][j] 是男运动员i 和女运动员j 配对组成混合双打的男运动员竞赛优势;Q[i][j] 是女运动员i和男运动员j 配合的女运动员竞赛优势。由于技术配合和心理状态等各种因素影响,P[i][j]不一定等于Q[j][i]。男运动员i 和女运动员j 配对组成混合双打的男女双方竞赛优势为P[i][j]*Q[j][i] 。设计一个算法,计算男女运动员最佳配对法, 使各组男女双方竞赛优势的总和达到最大。 算法设计: 设计一个优先队
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
Algorithm
- 01背包,批处理作业调度,动态规划,回溯,分支限界(01 knapsack, batch job scheduling, dynamic programming, backtracking, branch and bound.)
分枝限界算法
- 分支定界算法, 分支定界算法 分支定界算法 branch and bound(this is a branch and bound)