资源列表
[文件格式] C-W-savings-algorithm
说明:C-W节约算法是最经典的求解车辆路径问题的启发式算法。-The Clarke and Wright(1964) savings algorithm is perhaps the most widely known heuristic for the VRP.<abrahamlau> 在 2025-07-07 上传 | 大小:427kb | 下载:0
[文件格式] branch-and-cut-algorithm
说明:分支-切割法是把分支定界法与割平面法结合起来,用来求解混合整数规划问题。-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 h<abrahamlau> 在 2025-07-07 上传 | 大小:1.32mb | 下载:0
[文件格式] czichengxu
说明:有1、2、3、4个数字,能组成多少个互不相同且无重复数字的三位数?都是多少? 1.程序分析:可填在百位、十位、个位的数字都是1、2、3、4。组成所有的排列后再去 掉不满足条件的排列。 -There are numbers 1,2,3,4, how many can be composed of mutually exclusive and non-duplication of the same three-digit numbers? How many are? 1. P<fataimai> 在 2025-07-07 上传 | 大小:2kb | 下载:0
[文件格式] 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.<abrahamlau> 在 2025-07-07 上传 | 大小:607kb | 下载:0
[文档资料] visualcsharp.netprogramming
说明:Visual CSharp.Net Programming<xineo> 在 2025-07-07 上传 | 大小:2kb | 下载:0
[软件工程] Artila_log
说明:This the log generated by artila M501 starter kit while recovering loader, and u-boot-This is the log generated by artila M501 starter kit while recovering loader, and u-boot<sandy> 在 2025-07-07 上传 | 大小:1kb | 下载:0