搜索资源列表
fenzhidingjie
- 分支定界法，解决整数规划问题，很好的优化算法，可以学习-Branch and bound method to solve the problem of integer programming, a good optimization algorithm can learn
BOND_BRANCH_SS
- 利用分支定界法处理单源最短路径，很好的设定了上界下界。效率很高。-solve the problem “Shorttest Path Singal source” by using branch and bound
intprog
- 通过分支定界法计算线性规划、整数规划,效果较好。-To calculate integer programming, branch and bound method is better.
tsp_bb
- 旅行商问题的分支定界解法，含有详细的注释和说明，希望对你有用。-Branch and bound
xxx
- MATLAB分支定界法的实现，附带代码和例题-MATLAB implementation of branch and bound method, with code and examples
branch-and-bound
- 分支定界法求解TSp问题的分析研究以及matlab实现-Branch and bound method to solve the problem described TSp
0-1-Knapsack-problem
- 本次实验选择0-1背包问题作为题目，通过使用动态规划、回溯法和分支定界法等算法来求解该问题，从而进一步的了解各种算法的原理、思路及其本质，深化对算法的了解，锻炼自己对各种算法的分析和使用，熟悉软件底层算法和界面编程。-The 0-1 knapsack problem was chosen as the subject, through the use of dynamic programming, backtracking and branch and bound method algorit
matlabxuexi
- 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、 网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This is a good model to study the information, download it quick
Branch-and-bound-method
- MALAB写的，分支定界法求解纯整数或混合的整数规划问题。-Written MALAB, branch and bound method to solve pure integer or mixed integer programming problem.
fengzhidingjie
- 分支定界 MATLAB编程 分支 定界 剪枝 取整数解-Branch and bound MATLAB programming branch and bound pruning rounded solution
BNBGUI
- 分支定界算法的GUI版用来解整数规划问题相当方便-Branch and bound algorithm for the solution of the GUI version of integer programming problem Convenience ~ ~ ~
zsgh
- 整数规划，0-1整数规划，分支定界法求最优解-0-1 integer programming integer programming, branch and bound method for the optimal solution
math
- 这是有个关于整数分支定界法的程序，在数学建模中应用较多！-This is a branch and bound method for integer programs, the application of mathematical modeling more!
Branch_and_bound_for_TSP_tutorial
- 该程序是用分支定界算法解决旅行商问题，所用语言为Matlab-The program is branch and bound algorithm for TSP problem
BNBGUI
- 分支定界算法的GUI版用来解整数规划问题相当方便-Branch and bound algorithm for the solution of the GUI version of integer programming problem Convenience ~ ~ ~
BranchBound
- 分支定界方法，用于解决tsp问题，matlab实现。-Branch and bound method for solving the tsp problem, matlab realize.
TSP-PROBLEM
- C99标准实现的动态规划法和分支定界法解决TSP问题-Dynamic Programming Method and Brand-and-Bound Method Solving TSP Problem Under C99 Standard
fenzhidingjiefa
- 分支定界法能够用在处理整数规划问题中，是一种很经典的方法。希望大家有用！-Branch and bound method
evacuation
- 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法：模拟退火法、神经网-very goog
IntProgFZ
- 分支定界法，不断将可行域分割成小的集合，再找出最优解-Branch and bound method, the feasible region divided into a collection of small, then find out the optimal solution