文件名称:branch-and-cut-algorithm.rar
-
所属分类：
- 标签属性：
- 上传时间：2012-09-04
-
文件大小：1.32mb
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。
,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 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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
A branch-and-cut algorithm for the undirected selective traveling salesman problem.pdf
分支—切割法与分块TSP的分支—切割法.nh
改进的求解TSP混合分支裁剪法.pdf
Branch-and-Cut Algorithms for Combinatorial Optimization Problems.pdf
分支—切割法与分块TSP的分支—切割法.nh
改进的求解TSP混合分支裁剪法.pdf
Branch-and-Cut Algorithms for Combinatorial Optimization Problems.pdf
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.