最小费用最大流matlab代码-OR_tools:用于OR和探索性分析的MATLAB算法库
最小费用最大流matlab代码运筹学工具
该存储库具有我在做统计学和
OR
副修课程时创建的函数库，并实现了一些用于运筹学和多变量探索性分析的典型算法和方法。
所有代码都是用MATLAB编写的
优化
-
流和网络
(IP)
Pape、D'Esopo
和
Moore
算法
(PDM)：节点与图上所有其他节点之间的最短或最长路径（也检测循环）
算法：图上任何一对节点的最短或最长路径（也检测循环）
:
网络中的最大可行和保守流
:
网络中的最小成本流
Greedy1：下限值
:
设施位置问题的贪心求解器
系统分析和模拟
-
库存和项目管理
：确定性模型具有原始模型的几种变体，即
1)
数量折扣；
2)
允许断货；
3)
混合断货和数量折扣。
：估计具有随机需求的经济模型的参数，并在指定的时间段内模拟系统的行为。
可以设置为解决最高服务水平或每期最低成本。
：调度一组项目活动的算法。
关键路径是通过确定最长的相关活动范围并测量从开始到结束完成它们所需的时间来确定的。
绘制包含关键和非关键活动以及各自的松弛的最终时间表。
：用于项目管理的工具，用于分析和表示完成给定项目所涉及的任务。
考虑到项目
文件下载
资源详情
[{"title":"（ 59 个子文件 354KB ） 最小费用最大流matlab代码-OR_tools:用于OR和探索性分析的MATLAB算法库","children":[{"title":"OR_tools-master","children":[{"title":"README.md <span style='color:#111;'> 3.07KB </span>","children":null,"spread":false},{"title":"Ford-Fulkerson","children":[{"title":"buildGraph.m <span style='color:#111;'> 1.38KB </span>","children":null,"spread":false},{"title":"scanPath.m <span style='color:#111;'> 4.12KB </span>","children":null,"spread":false},{"title":"ford.m <span style='color:#111;'> 3.30KB </span>","children":null,"spread":false},{"title":"FFSLIDES.dat <span style='color:#111;'> 271B </span>","children":null,"spread":false},{"title":"FLUMAX.dat <span style='color:#111;'> 337B </span>","children":null,"spread":false}],"spread":true},{"title":"LICENSE <span style='color:#111;'> 1.04KB </span>","children":null,"spread":false},{"title":"Principal Component Analysis","children":[{"title":"AEDM_raw.csv <span style='color:#111;'> 1.36KB </span>","children":null,"spread":false},{"title":"pca_report.m <span style='color:#111;'> 3.33KB </span>","children":null,"spread":false}],"spread":true},{"title":"Floyd-Warshall","children":[{"title":"floyd.m <span style='color:#111;'> 3.44KB </span>","children":null,"spread":false},{"title":"FLOYD.DAT <span style='color:#111;'> 180B </span>","children":null,"spread":false},{"title":"getpath.m <span style='color:#111;'> 484B </span>","children":null,"spread":false},{"title":"getcycle.m <span style='color:#111;'> 415B </span>","children":null,"spread":false}],"spread":true},{"title":"Greedy1","children":[{"title":"knapshack2.mat <span style='color:#111;'> 797B </span>","children":null,"spread":false},{"title":"greedy1.m <span style='color:#111;'> 1.65KB </span>","children":null,"spread":false},{"title":"knapshack1.mat <span style='color:#111;'> 796B </span>","children":null,"spread":false}],"spread":true},{"title":"Clustering Methods","children":[{"title":"firstcitiesprime.csv <span style='color:#111;'> 18.83KB </span>","children":null,"spread":false},{"title":"runkMeans.m <span style='color:#111;'> 1.10KB </span>","children":null,"spread":false},{"title":"cluster.m <span style='color:#111;'> 3.47KB </span>","children":null,"spread":false},{"title":"computeCentroids.m <span style='color:#111;'> 1.42KB </span>","children":null,"spread":false},{"title":"kMeansInitCentroids.m <span style='color:#111;'> 721B </span>","children":null,"spread":false},{"title":"findClosestCentroids.m <span style='color:#111;'> 1.55KB </span>","children":null,"spread":false},{"title":"hierarchic.m <span style='color:#111;'> 1.78KB </span>","children":null,"spread":false}],"spread":true},{"title":"Project Evaluation and Review Technique","children":[{"title":"cpmPert.m <span style='color:#111;'> 2.99KB </span>","children":null,"spread":false},{"title":"buildGraph.m <span style='color:#111;'> 2.13KB </span>","children":null,"spread":false},{"title":"PERT11.dat <span style='color:#111;'> 120B </span>","children":null,"spread":false},{"title":"pert.m <span style='color:#111;'> 1.84KB </span>","children":null,"spread":false}],"spread":true},{"title":"Critical Path Method","children":[{"title":"cpm.m <span style='color:#111;'> 5.34KB </span>","children":null,"spread":false},{"title":"buildGraph.m <span style='color:#111;'> 1.62KB </span>","children":null,"spread":false},{"title":"activityToIndex.m <span style='color:#111;'> 753B </span>","children":null,"spread":false},{"title":"cpm_schedule.jpg <span style='color:#111;'> 50.41KB </span>","children":null,"spread":false},{"title":"CPM.dat <span style='color:#111;'> 64B </span>","children":null,"spread":false}],"spread":true},{"title":"Facility Location Problem","children":[{"title":"flp.m <span style='color:#111;'> 1.96KB </span>","children":null,"spread":false},{"title":"flprob1.mat <span style='color:#111;'> 257B </span>","children":null,"spread":false}],"spread":true},{"title":"Stochastic Model with Continuous Review","children":[{"title":"sim.jpg <span style='color:#111;'> 253.04KB </span>","children":null,"spread":false},{"title":"ex6.mat <span style='color:#111;'> 339B </span>","children":null,"spread":false},{"title":"smartFill.m <span style='color:#111;'> 3.26KB </span>","children":null,"spread":false},{"title":"ex7.mat <span style='color:#111;'> 322B </span>","children":null,"spread":false},{"title":"ex5c.mat <span style='color:#111;'> 290B </span>","children":null,"spread":false},{"title":"stochastic.m <span style='color:#111;'> 471B </span>","children":null,"spread":false},{"title":"ex5b.mat <span style='color:#111;'> 323B </span>","children":null,"spread":false},{"title":"smcr.m <span style='color:#111;'> 7.72KB </span>","children":null,"spread":false}],"spread":true},{"title":"Economic Order Quantity","children":[{"title":"X1.mat <span style='color:#111;'> 293B </span>","children":null,"spread":false},{"title":"mixed_model.jpg <span style='color:#111;'> 293.74KB </span>","children":null,"spread":false},{"title":"ex3.mat <span style='color:#111;'> 286B </span>","children":null,"spread":false},{"title":"ex4.mat <span style='color:#111;'> 234B </span>","children":null,"spread":false},{"title":"eoq.m <span style='color:#111;'> 5.84KB </span>","children":null,"spread":false}],"spread":true},{"title":"PDM","children":[{"title":"PDM.dat <span style='color:#111;'> 300B </span>","children":null,"spread":false},{"title":"pdm.m <span style='color:#111;'> 3.97KB </span>","children":null,"spread":false},{"title":"buildGraph.m <span style='color:#111;'> 625B </span>","children":null,"spread":false},{"title":"PDM2.dat <span style='color:#111;'> 521B </span>","children":null,"spread":false}],"spread":true},{"title":"Out-Of-Kilter","children":[{"title":"dados4.ou1 <span style='color:#111;'> 374B </span>","children":null,"spread":false},{"title":"updateStates.m <span style='color:#111;'> 960B </span>","children":null,"spread":false},{"title":"kilter.m <span style='color:#111;'> 4.46KB </span>","children":null,"spread":false},{"title":"buildGraph.m <span style='color:#111;'> 1.89KB </span>","children":null,"spread":false},{"title":"dados3.ou1 <span style='color:#111;'> 265B </span>","children":null,"spread":false},{"title":"dados2.ou1 <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false},{"title":"scanCycle.m <span style='color:#111;'> 5.04KB </span>","children":null,"spread":false},{"title":"dados.ou1 <span style='color:#111;'> 592B </span>","children":null,"spread":false}],"spread":false}],"spread":false}],"spread":true}]
评论信息
其他资源
- 用Qt写俄罗斯方块游戏的教程和源码
- 多层低温共烧陶瓷技术
- 基于SOA神经网络的PID参数自整定程序源代码
- 图论基本程序
- 破解ServiceStack.Redis每小时6000次限制--ServiceStack4.5.6的破解版
- SM2&SM3;&SM4;国密算法的C语言实现.rar
- BP神经网络训练算法Matlab代码
- 整合spring框架的jar包
- MC9S08DZ60评估板例程_程序_开发板手册
- vfp大学成绩查询系统
- 基于STM32高精度频率计的设计
- MATLAB App designer 电子词典
- FANUC机器人的零点复归操作和相关故障处理.docx
- 图像分割算法的实现
- IK分词solr5.0.0
- the c programming language 的答案（官方版pdf和非官方版chm）
- easeljs-0.7.1.min.js
- 哈工大课程设计之千斤顶
- 达内java培训内部资料pdf 百度网盘下载(有效地址)
- junit4 jar包以及源码
免责申明
【只为小站】的资源来自网友分享，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论 【只为小站】 经营者是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明