Description: 本程序是利用Ford和Fulkerson迭加算法，求最小费用最大流-use of this procedure is superposition Ford and Fulkerson algorithm, the minimum cost for maximum flow Platform: |
Size: 2048 |
Author:李平 |
Hits:
Description: 本文用Ｃ语言实现了优化算法－最小费用最大流算法，主要用于图论领域-Using C programming language, the optimization algorithm-minimum cost maximum flow algorithm, mainly for the field of graph theory Platform: |
Size: 3072 |
Author:申辉 |
Hits:
Description: 用Floyd算法设计的最小费用最大流，求最大流时，用的是标号算法-Floyd algorithm design with the minimum cost maximum flow, for maximum flow, the algorithm is labeling Platform: |
Size: 1024 |
Author:杨 |
Hits:
Description: 最大最小流程序。包括最大流网络，最小费用最大流。算法的一些实现。-Max-min flow procedures. Including the maximum flow network, minimum cost maximum flow. Some of realize algorithm. Platform: |
Size: 110592 |
Author:HuiCong |
Hits:
Description: 可行点标记求最佳匹配算法的MATLAB 程序代码 求最小费用最大流算法的MATLAB 程序代码 匈牙利算法的MATLAB 程序代码 遗传算法解决TSP问题的Matlab程序 遗传算法解决非线性规划问题的Matlab程序 -Feasible point marking the best matching algorithm for the MATLAB code for the minimum cost maximum flow algorithm of the MATLAB program code Hungarian algorithm MATLAB code genetic algorithm to solve TSP problems Matlab procedures for genetic algorithm to solve nonlinear programming problems Matlab procedures Platform: |
Size: 119808 |
Author: |
Hits:
Description: 解决图论中Warshall-Floyd 算法，Kruskal 避圈法，匈牙利算法，求最佳匹配的算法，求最大流的Ford--Fulkerson 标号算法，求解最小费用流问题的matlab程序-Solve the graph theory Warshall-Floyd algorithm, Kruskal avoid lap law, Hungary algorithm, and the best matching algorithm, for maximum flow of the Ford- Fulkerson labeling algorithm for solving the minimum cost flow problem of matlab procedures Platform: |
Size: 47104 |
Author:yangfei |
Hits:
Description: 使用集合命令编写的图论最短路dijkstra算法的matlab程序，flord算法的matlab程序，最大匹配的匈牙利算法（hungary）matlab程序，最小生成树的两种方法编写的matlab程序，最小费用最大流matlab程序-Prepared in order to use a collection of graph theory Dijkstra shortest path algorithm matlab program, flord algorithm matlab procedures, the maximum matching algorithm Hungary (hungary) matlab procedures, minimum spanning tree, prepared by two methods matlab procedures, the minimum cost maximum flow matlab program Platform: |
Size: 5120 |
Author:任龙 |
Hits:
Description: floyd最短路算法&求网络的最小费用最大流&匈牙利算法&求网络的最小费用最大流-Floyd s short for network algorithm and the minimum cost flow and Hungary algorithm for the minimum cost and maximum flow network Platform: |
Size: 238592 |
Author:江奇 |
Hits:
Description: “基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。
-" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow. Platform: |
Size: 1024 |
Author:biaoshi |
Hits:
Description: C++ 写的一些算法模板 ，比如Kruskal、KMP、欧几里德算法、最大匹配(匈牙利算法)、最小费用最大流、字符串的哈希方法、增广路算法、网络最大流_邻接表等-C++ write some algorithms template, such as Kruskal, KMP, Euclid arithmetic, maximal matching (Hungary) is proposed, the minimum cost and maximum flow, string hash method, augmented road algorithm, network maximum flow _ adjlink etc...... Platform: |
Size: 995328 |
Author:zhzhl |
Hits:
Description: 各种算法模板（二分图最大匹配匈牙利算法、最小生成树prime和kruskal算法、Dijkstra算法、两点最短路径负权值边SPFA算法、图任意两点最短路径Floy算法、网络最大流SAP算法、网络最大流最小费用算法、乘法逆元gcd扩展求解算法、线段树区间划分统计算法、矩阵n次方分治法求解、gcd算法、整数划分问题、函数最小点问题、十进制转ACM算法、素数筛选法和欧拉函数求解、快模算法、字符串匹配KMP算法、字典全排列算法、快排、三维度排序、）-Various algorithms template (bipartite graph matching Hungarian algorithm, the minimum spanning tree the prime and kruskal algorithm, Dijkstra algorithm, two shortest path negative weight value side SPFA algorithm, Fig any two points on the shortest path Floy algorithms, network flow SAP algorithms, network maximum flow minimum cost algorithm multiplicative inverse gcd expansion algorithm, segment tree interval division statistical algorithms, the matrix of the n-th power of divide and conquer to solve the gcd algorithm, integer division problem, the minimum point of the function, decimal turn ACM algorithm, primes screening method solving and Euler function, fast mode algorithm, the string matching KMP algorithm, a dictionary full array algorithm, fast row, the sort of three dimensional) Platform: |
Size: 18432 |
Author:林云 |
Hits:
Description: 解决最小费用最大流问题，一般有两条途径。一条途径是先用最大流算法算出最大流，然后根据边费用，检查是否有可能在流量平衡的前提下通过调整边流量，使总费用得以减少？只要有这个可能，就进行这样的调整。调整后，得到一个新的最大流。-Minimum cost maximum flow problem to solve, there are generally two ways. One way is to use a maximum flow algorithm to calculate the maximum flow, then the cost side, check whether it is possible under the premise of the flow balance by adjusting the edge flow, so that the total cost can be reduced? As long as this possible, for such adjustments. Adjusted to obtain a new maximum flow. Platform: |
Size: 1024 |
Author:刘适 |
Hits:
Description: 网络流算法和最小费用流，用来处理图论问题中的流量计算和流量限制的费用流计算-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 Platform: |
Size: 2048 |
Author:yin |
Hits:
Description: 使用MFC实现最小费用流算法 包括在界面上画拓扑图等功能，编译器VC6.0(Using MFC to realize the minimum cost flow algorithm, including the function of drawing topological graph on the interface, compiler VC6.0) Platform: |
Size: 6120448 |
Author:soon123 |
Hits:
Search - Minimum Cost Flow Algorithm