Welcome![Sign In][Sign Up]
Location:
Search - branch

Search list

[OtherBranch and Bound

Description: Branch and Bound 算法实现.用以快速搜索一个区域.-Branch and Bound algorithm. Quick search for a regional.
Platform: | Size: 27408 | Author: smt | Hits:

[Mathimatics-Numerical algorithmsBRANCH

Description: 分枝定界法,运筹学-branch-and-bound method, and operations
Platform: | Size: 1678 | Author: | Hits:

[Mathimatics-Numerical algorithmsfenzhidingjie beibao

Description: 分支定界的0/1背包问题-branch delimitation of the 0/1 knapsack problem
Platform: | Size: 1024 | Author: 姜艳艳 | Hits:

[Documents分枝定界算法

Description: 分枝定界算法描述,文本形式!-branch-and-bound algorithm description, in text form!
Platform: | Size: 15360 | Author: 王林 | Hits:

[Mathimatics-Numerical algorithmsBRANCH

Description: 分枝定界法,运筹学-branch-and-bound method, and operations
Platform: | Size: 1024 | Author: | Hits:

[OtherLCbb_TSP

Description: LC分枝限界法解货郎担—代码-LC Branch and Bound Solving traveling salesman- code
Platform: | Size: 59392 | Author: 张强 | Hits:

[Data structs分支限界法_单源最短路径

Description: 算法设计的分支限界法中的单源最短路径问题的实现,是用VC++编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC++ prepared
Platform: | Size: 3072 | Author: ddd | Hits:

[Other分支限界法_批处理作业调度

Description: 算法设计中的分支限界法中的批处理作业调度问题的实现,是用VC++编写的-algorithm design of branch and bound method of batch job scheduling problem is true, VC++ prepared
Platform: | Size: 10240 | Author: ddd | Hits:

[Algorithm分支与界法

Description: 图论中使用分支与界法求解旅行商问题,直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run
Platform: | Size: 2048 | Author: 谢继晖 | Hits:

[Mathimatics-Numerical algorithms货郎担分枝限界算法图形

Description: 货郎担 分枝限界算法图形求解货郎担问题的分枝限界算法图形演示-traveling salesman Branch and Bound graphics algorithm to solve the traveling salesman problem Branch and Bound algorithm graphic demonstration
Platform: | Size: 4096 | Author: 李宏亮 | Hits:

[Data structsdynamic knapsack

Description: 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable.
Platform: | Size: 3072 | Author: 唐海浪 | Hits:

[Data structsmazh

Description: 旅行商问题的算法,采用分枝限界。网上都只有算法描述,没有实现,这里给出了完整实现,并封装成1个类。-TSP algorithm used Branch and Bound. Only online algorithm description, failed to materialize here is the realization of complete, and packaged as a category.
Platform: | Size: 2048 | Author: 赵刚 | Hits:

[Other分支界限

Description: 用vc编写的解决计算机算法中的分支限界问题,非常经典的代码,请多多指教!-vc prepared with the computer algorithm to solve the branch and bound, very classic code, a great weekend!
Platform: | Size: 498688 | Author: 徐子正 | Hits:

[Data structs用分枝定界法求解TSP

Description: 分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的-branch and bound method can solve small-scale TSP, this example was prepared by the vc
Platform: | Size: 163840 | Author: yy | Hits:

[OtherBranch and Bound

Description: Branch and Bound 算法实现.用以快速搜索一个区域.-Branch and Bound algorithm. Quick search for a regional.
Platform: | Size: 27648 | Author: smt | Hits:

[transportation applicationsbranch-cut

Description: 干涉合成孔径雷达成像的相位解缠的枝切法程序。-Interferometric synthetic aperture radar imaging of the phase unwrapping process of the branch-cut method.
Platform: | Size: 13312 | Author: wang yan | Hits:

[Mathimatics-Numerical algorithmsbranch

Description: 运筹学中的分支界定算法,c++代码,可以运行-Define a branch of operations research in algorithms, c++ Code can run
Platform: | Size: 1024 | Author: leoee | Hits:

[assembly languagebranch

Description: 汇编程序的分支程序的设计 编写程序,将一个包含有20个数据的数组M分成两个数组:正数数组和负数数组N,并分别把这两个数组中的数据存储在数组M1和M2中。-Assembler branch design procedures programming, one containing 20 data array M is divided into two arrays: an array of positive and negative array N, and, respectively, these two arrays of data stored in the array in the M1 and M2 .
Platform: | Size: 4096 | Author: | Hits:

[File Formatbranch-and-cut-algorithm

Description: 分支-切割法是把分支定界法与割平面法结合起来,用来求解混合整数规划问题。-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.
Platform: | Size: 1384448 | Author: abrahamlau | Hits:

[File FormatBranch-and-Price

Description: 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.
Platform: | Size: 621568 | Author: abrahamlau | Hits:
« 12 3 4 5 6 7 8 9 10 ... 50 »

CodeBus www.codebus.net