搜索资源列表
minSu3
- 利用lingo求解网络流量分配矩阵,网络节点数可修改,默认为20。首先输入K条路径矩阵以及其他网络信息,以最小化链路利用率的平方为优化目标对流量进行分配。-Use lingo solving network traffic assignment matrix, the network nodes can be modified, the default is 20. First, enter the path matrix K and other network information to m
1141
- 用LINGO编辑的关于选课的一段小程序,9个课程,有先修要求,满足学分要求,求最少课程-Edited with LINGO a small program on elective, nine courses have pre request, to meet the credit requirements, minimum course requirements
MF-MMF-C
- 里面有最大流,最小费用最大流和着色问题的matlab程序和lingo程序-Here are Matlab and Lingo codes for maximum flow problem,minimum cost maximum flow algorithm and coloring problem
planning-problem
- 本程序是用来求解数学优化的问题,和lingo比较相似,但是是在matlab中运行-This procedure is used to solve mathematical optimization problems, and lingo is quite similar, but is running in matlab
lingoCluster
- 用于自然语言处理中的Lingo聚类算法,是carrot2开源搜索中的核心代码。由波兰学者Osinski编写-For natural language processing Lingo clustering algorithm, is carrot2 open source search in the core code. Prepared by the Polish scholar Osinski
LINGO1没完成
- 计算数值哼厉害的哦,你造嘛 ? 哼厉害哦的那种哦(good yutubimeiymaobing ok yeshi)
LINGO11
- lingo软件下载压缩包,挺好的!真的挺好的!你可以试试~(Lingo software download compressed package, very good!)
Lingo1
- 求解tsp问题,得到哈密顿图,得到最优路程线路(The Hamiltonian problem is obtained by solving the TSP problem.Get the best distance line.)
肠衣
- 2011年数学建模大赛D题Lingo编程,简化版本,可直接运行,得出第一问的结果。(2011 mathematical modeling contest D title, Lingo programming, simplified version, can be directly run, and get the results of the first question.)
LINGO1
- TSP问题的lingo程序,结合maltab(TSP problems lingo procedures, combined with maltab)
常用算法
- 经典只智能算法,功能挺强的,但是有时候觉得没lingo好用(Classic intelligent algorithm, the function is very strong, but sometimes do not feel good lingo)
lingo9.0汉化补丁
- lingo9.0版本的汉化补丁,可直接解压使用(LINGO9.0 version of the finished patch)
lingo9.0破解版
- lingo9.0破解版,内含key可直接破解,请参考内附说明书(LINGO9.0 crack version, containing key can be directly cracked, please refer to the enclosed instructions)
intPorg
- 整数规划;分支定界实现整数求解 首先需要建好模型(Integer programming; branch and bound to achieve integer solution, we first need to build model)
NXVYMK
- LINGO软件教程,lingo软件提供强大的数学建模功能,()
一维下料问题(一次解决)
- 一次性解决单一原材料,多种需求的算法,简单快捷。(one-dimension cutting stock problem)
PMPproblem
- 求解PMP问题,在N个节点中找到k个节点,使得其余N-k个节点到这k个节点的距离最短。k为自定义值。输入文件为xlsx格式,N*N的距离矩阵。(To solve the PMP problem, the K node is found in the N node, making the rest of the rest of the N-k nodes to be the shortest distance to the K node. K is a custom value. The inpu
lingo8.0
- LINGO是Linear Interactive and General Optimizer的缩写,即“交互式的线性和通用优化求解器”,由美国LINDO系统公司(Lindo System Inc.)推出的,可以用于求解非线性规划,也可以用于一些线性和非线性方程组的求解等,功能十分强大,是求解优化模型的最佳选择。其特色在于内置建模语言,提供十几个内部函数,可以允许决策变量是整数(即整数规划,包括 0-1 整数规划),方便灵活,而且执行速度非常快。能方便与EXCEL,数据库等其他软件交换数据。