搜索资源列表
货郎担分枝限界图形演示
- 货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品,已知各城市之间的路程(或旅费)。他要选定一条从驻地出发,经过每个城市一遍,最后回到驻地的路线,使总的路程(或旅费)最小。-traveling salesman Branch and Bound graphic demonstration Problem descr iption : A salesman to a number of cities to sell co
分枝定界算法
- 分枝定界算法描述,文本形式!-branch-and-bound algorithm descr iption, in text form!
货郎担分枝限界算法图形
- 货郎担 分枝限界算法图形求解货郎担问题的分枝限界算法图形演示-traveling salesman Branch and Bound graphics algorithm to solve the traveling salesman problem Branch and Bound algorithm graphic demonstration
分枝定界算法
- 分枝定界算法描述,文本形式!-branch-and-bound algorithm descr iption, in text form!
BRANCH
- 分枝定界法,运筹学-branch-and-bound method, and operations
LCbb_TSP
- LC分枝限界法解货郎担—代码-LC Branch and Bound Solving traveling salesman- code
货郎担分枝限界算法图形
- 货郎担 分枝限界算法图形求解货郎担问题的分枝限界算法图形演示-traveling salesman Branch and Bound graphics algorithm to solve the traveling salesman problem Branch and Bound algorithm graphic demonstration
mazh
- 旅行商问题的算法,采用分枝限界。网上都只有算法描述,没有实现,这里给出了完整实现,并封装成1个类。-TSP algorithm used Branch and Bound. Only online algorithm descr iption, failed to materialize here is the realization of complete, and packaged as a category.
用分枝定界法求解TSP
- 分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的-branch and bound method can solve small-scale TSP, this example was prepared by the vc
货郎担分枝限界图形演示
- 货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品,已知各城市之间的路程(或旅费)。他要选定一条从驻地出发,经过每个城市一遍,最后回到驻地的路线,使总的路程(或旅费)最小。-traveling salesman Branch and Bound graphic demonstration Problem descr iption : A salesman to a number of cities to sell co
01背包问题
- 采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~-used Branch and Bound France 0/1 knapsack problem! I practice on the machine operations, acceptance by the teachers, qualified! In view of the attachment on the
01package
- 背包问题优先队列分枝限界算法 所谓的背包问题,可以描述如下:一个小偷打劫一个保险箱,发现柜子里有N类不同大小与价值的物品,但小偷只有一个容积为M的背包来装东西,背包问题就是要找出一个小偷选择所偷物品的组合,以使偷走的物品总价值最大。这个问题的求解有很多种方法,本程序使用分枝限界法求解。-knapsack problem Branch and Bound priority queue algorithm called knapsack
tsp.c
- 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes
MATLAB_FD
- 整数规划的分枝定界法在MATLAB中的实现-integer programming branch of the profession in the realization of MATLAB
search_method
- 搜索算法——包含回溯法、分枝定界和贪心法-Search algorithm- includes backtracking, branch and bound and the greedy method
fenzhidingjieMATLAB
- 分枝定界法求解整数规划的MATLAB实现-Branch and Bound Method for Solving Integer Programming MATLAB to achieve
bnb20
- 非线性整数规划算法,求解非线性整数规划活混合规划问题,常用的算法是分枝定界算法。基于该算法编成的现成函数bnb20()-Nonlinear integer programming algorithm for solving nonlinear mixed integer programming live planning problem, commonly used algorithms are branch-and-bound alg
Branch-and-Price
- Branch—and—Price,一种广义分枝定界或分枝定界的扩展算法,它允许列生成过程应用于整个分枝定界树-The philosophy of branch-and-price is similar to that of branch-and-cut except that the procedure focuses on col- umn generation rather than row generation.
BNB
- 工具箱 (分枝定界法工具箱) matlab 中使用-Toolbox (Toolbox branch and bound method) matlab use
用分枝定界法求解整数线性规划问题
- matlab代码,用分枝定界法求解整数线性规划问题。(Matlab code, use the branch and bound method for solving integer linear programming problem.)