Description: 最大流问题的算法，思路清晰，很值得收藏。大家赶快下载-Algorithm for maximum flow problem is clearly thought worthy of collection. U.S. soon to download Platform: |
Size: 78848 |
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: 关于最大流量的问题，涉及图论，等等，是matlab程序-On the maximum flow problem, involving graph theory, and so on, is the matlab program Platform: |
Size: 1024 |
Author:haboy |
Hits:
Description: 关于网络流的一些代码，解题报告有最大流，最小费用最大流等-On a number of network flow code, problem-solving report maximum flow, minimum cost maximum flow, etc. Platform: |
Size: 7168 |
Author:tjj |
Hits:
Description: 最小费用最大流问题,是用C实现的，比较高效率-Minimum cost maximum flow problem is to use C to achieve relatively high efficiency Platform: |
Size: 14336 |
Author:雷毅华 |
Hits:
Description: 图论中最大流问题的matlab实现代码，求给定网络最大流-Maximum flow problem in graph theory implementation of matlab code, seeking maximum flow in a given network Platform: |
Size: 1024 |
Author:zy |
Hits:
Description: 用VC++6.0求算法分析设计中的最大流问题。-Using VC++6.0 analysis of algorithms designed to seek the maximum flow problem. Platform: |
Size: 1024 |
Author:佳 |
Hits:
Description: 使用push-relabel方法求解最大流问题，是国外的一个研究机构编写的，速度很快。-This is an efficient implementation of the push-relabel method.
See
Goldberg and Tarjan, "A New Approach to the Maximum Flow Problem,"
J. ACM Vol. 35, 921--940, 1988
and
Cherkassky and Goldberg, "On Implementing Push-Relabel Method for the
Maximum Flow Problem," Proc. IPCO-4, 157--171, 1995. Platform: |
Size: 26624 |
Author:顾徐鹏 |
Hits:
Description: 关于最大流问题，与最大匹配的讲解。内容比较浅显易懂。-On the maximum flow problem, with the largest matching explained. The study were easy to understand. Platform: |
Size: 359424 |
Author:姜珊珊 |
Hits:
Description: 最大流问题的最短增广路径算法 是算法中的重要部分
-Maximum flow problem of the shortest augmenting path algorithm is an important part of the algorithm Platform: |
Size: 22528 |
Author:luomin |
Hits:
Description: 用于求解网络的最小费用最大流问题，求一个网络中的最大流-Network for solving the minimum cost maximum flow problem, find the maximum flow in a network Platform: |
Size: 2048 |
Author:wuhao |
Hits:
Description: 运筹学中的最大流与最小载问题求解matlab源程序-Operations Research in the maximum flow and minimum load problem solving matlab source code Platform: |
Size: 220160 |
Author:张爽 |
Hits:
Description: 用增广路法计算最大流问题，给出了C++代码-Augmenting path method to calculate the maximum flow problem given C++ code Platform: |
Size: 2048 |
Author:郁文竹 |
Hits:
Description: 最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下，此类问题的研究试图寻找出：流量从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" and " costs" two limiting conditions, such problems of trying to find out: Flow from A to B, how to choose the path, the path of the flow through the distribution can be achieved The use of the minimum cost requirements. Platform: |
Size: 1024 |
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: 最大流问题C++实现，对于数学建模或者图像处理领域都有较大帮助。-Maximum flow problem in C++, or in the field of mathematical modeling for image processing have greatly help. Platform: |
Size: 833536 |
Author:刘灿 |
Hits:
Description: 此程序能够解决网络中最小费用最大流问题，内含调试结果及解释。并附有分析流程，结果分析。-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. Platform: |
Size: 4057088 |
Author:dragon gao |
Hits:
Search - maximum flow problem