搜索资源列表
最小费用最大流算法通用Matlab程序
- 基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 ％ 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 ％ 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 ％ 确定,如此多次迭代,最终得到最小费用最大流.,Basic ideas: to each arc on the unit cost of traffic as some length, with Floyd for the most shor
ACM_template.rar
- 本人参加ACM竞赛使用的一些算法模板，包括二分图匹配，欧拉回路的构造以及网络流中的最大流与最小费用最大流等，可以说实战性非常强。,ACM competitions I take part in a number of algorithms used in templates, including two sub-graph matching, Euler circuit, as well as network flow structure of the maximum flow and mini
opf
- 最小费用最大流的一个实验程序,可以根据具体问题来重新修改-Minimum cost maximum flow in an experimental procedure may be based on specific issues to re-modify the
matlab
- floyd最短路算法&求网络的最小费用最大流&匈牙利算法&求网络的最小费用最大流-Floyd s short for network algorithm and the minimum cost flow and Hungary algorithm for the minimum cost and maximum flow network
maxflow
- 关于网络流的一些代码，解题报告有最大流，最小费用最大流等-On a number of network flow code, problem-solving report maximum flow, minimum cost maximum flow, etc.
minmax
- 最小费用最大流问题,是用C实现的，比较高效率-Minimum cost maximum flow problem is to use C to achieve relatively high efficiency
MinimumCostFlow
- 最小费用最大流问题 MATLAB编程代码-Maximum flow problem minimum cost MATLAB programming code
deopf
- 也是一个最小费用最大流的程序,在应用时可以参考程序思路进行重新设计-Is also a minimum cost maximum flow procedure in the application can refer to the process redesign ideas
2
- 最小费用最大流 C语言编程，运筹学 C语言最小费用最大流-Minimum Cost Flow C language programming, operations research
SuccessiveShortest
- This algoritm minimum cost flow wiht succesive succes algoritm. It s easy to learning person algoritm. You try this.-This is algoritm minimum cost flow wiht succesive succes algoritm. It s easy to learning person algoritm. You try this.
minimum-cost-maximum-flow
- 用于求解网络的最小费用最大流问题，求一个网络中的最大流-Network for solving the minimum cost maximum flow problem, find the maximum flow in a network
Minimum-cost-maximum-flow-algorithm
- 最大流最小费用算法-Minimum cost maximum flow algorithms. . . . . . . . . . . . . . .
Minimum-Cost-Flow
- 最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下，此类问题的研究试图寻找出：流量从A到B，如何选择路径、分配经过路径的流量，可以达到所用的费用最小的要求。-Minimum cost maximum flow problem is economics and management in a class of typical problems. Each path in a network has the " capacity&q
ford-max-flow
- 解决最小费用最大流问题，一般有两条途径。一条途径是先用最大流算法算出最大流，然后根据边费用，检查是否有可能在流量平衡的前提下通过调整边流量，使总费用得以减少？只要有这个可能，就进行这样的调整。调整后，得到一个新的最大流。-Minimum cost maximum flow problem to solve, there are generally two ways. One way is to use a maximum flow algorithm to calculate the maxim
zuixiaofeiyongliu
- 最小费用流问题用于求解，图论中两地区运输费用最少的问题，本程序通过MATLAB解决这一问题-For solving the minimum cost flow problem in graph theory two least-cost regional transportation issues, the procedure to solve this problem through MATLAB
zuixiaochengbenliu
- 程序由C语言完成，用Visual Studio 2012编译即可运行。 首先图的格式应为邻接矩阵，程序会提示输入n的大小，然后依次输入节点i，j，以及该节点的容量和成本。容量运费为0可以不用填写。以此类推，直到输入的节点为-1，-1则停止输入。 程序输出最小成本流邻接矩阵和最小成本。-Procedures done by the C language, using Visual Studio 2012 compiler to run. First graph format shoul
Minimum-cost-maximum-flow-
- 此程序能够解决网络中最小费用最大流问题，内含调试结果及解释。并附有分析流程，结果分析。-This program can solve the minimum cost maximum network flow problem, containing debugging results and interpretation. Together with the analysis process, the results of the analysis.
123
- 网络流算法和最小费用流，用来处理图论问题中的流量计算和流量限制的费用流计算-Network flow algorithm and the minimum cost flow problem in graph theory to deal with the cost of computing and traffic flow restrictions stream computing
zkw
- 大神提供的最小成本流的简便算法，给大家进行参考，希望有所收获-Minimum Cost Flow
flow
- 计算最大流、最小费用最大流、最小费用可行流的算法模板-The calculation of the maximum flow, minimum cost maximum flow, minimum cost feasible flow algorithm template