文件名称:branch-and-cut-algorithm
- 所属分类：
- 文件格式
- 资源属性：
- [PDF]
- 上传时间：
- 2012-11-26
- 文件大小：
- 1.32mb
- 下载次数：
- 0次
- 提 供 者：
- abrah*****
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。-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 integer values. The method is a hybrid of branch and bound and cutting plane methods.
相关搜索： branch
and
cut
分支定界
for
branch
and
cut
algorithm
branch
algorithm
branch-and-cut
algorithm
matlab
branch
and
bound
and
cut
分支定界
for
branch
and
cut
algorithm
branch
algorithm
branch-and-cut
algorithm
matlab
branch
and
bound
(系统自动生成,下载前可以参看下载内容)
下载文件列表
A branch-and-cut algorithm for the undirected selective traveling salesman problem.pdf
Branch-and-Cut Algorithms for Combinatorial Optimization Problems.pdf
分支—切割法与分块TSP的分支—切割法.nh
改进的求解TSP混合分支裁剪法.pdf
Branch-and-Cut Algorithms for Combinatorial Optimization Problems.pdf
分支—切割法与分块TSP的分支—切割法.nh
改进的求解TSP混合分支裁剪法.pdf