当前位置:
首页 资源下载
搜索资源 - maximum flow problem
搜索资源列表
-
0下载:
图论中最大流问题的matlab实现代码,求给定网络最大流,Maximum flow problem in graph theory implementation of matlab code, seeking maximum flow in a given network
-
-
0下载:
关于网络流的一些代码,解题报告有最大流,最小费用最大流等-On a number of network flow code, problem-solving report maximum flow, minimum cost maximum flow, etc.
-
-
0下载:
最小费用最大流问题,是用C实现的,比较高效率-Minimum cost maximum flow problem is to use C to achieve relatively high efficiency
-
-
0下载:
最大流或最小割问题的算法实现,采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
-
-
0下载:
清华大学版运筹学最大流问题实验代码,C++程序。-Operations Research:Code
of the Maximum Flow Problem
-
-
0下载:
最小费用最大流问题 MATLAB编程代码-Maximum flow problem minimum cost MATLAB programming code
-
-
0下载:
用VC++6.0求算法分析设计中的最大流问题。-Using VC++6.0 analysis of algorithms designed to seek the maximum flow problem.
-
-
0下载:
使用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 Gol
-
-
0下载:
关于最大流问题,与最大匹配的讲解。内容比较浅显易懂。-On the maximum flow problem, with the largest matching explained. The study were easy to understand.
-
-
0下载:
最大流问题的最短增广路径算法 是算法中的重要部分
-Maximum flow problem of the shortest augmenting path algorithm is an important part of the algorithm
-
-
0下载:
有流量上下界的最大流最小流算法实现 C-solve Maximum-flow problem C++
-
-
0下载:
解决最小费用最大流的问题,是一个通用程序,希望大家喜欢-Solve the minimum cost maximum flow problem is a common procedure, hope you like
-
-
0下载:
最大流的一种通用算例程序,解决很多最大流的问题。-Maximum flow of a generic example program to solve many maximum flow problem.
-
-
0下载:
用于求解网络的最小费用最大流问题,求一个网络中的最大流-Network for solving the minimum cost maximum flow problem, find the maximum flow in a network
-
-
0下载:
运筹学中的最大流与最小载问题求解matlab源程序-Operations Research in the maximum flow and minimum load problem solving matlab source code
-
-
0下载:
用增广路法计算最大流问题,给出了C++代码-Augmenting path method to calculate the maximum flow problem given C++ code
-
-
1下载:
最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下,此类问题的研究试图寻找出:流量从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
-
-
0下载:
解决最小费用最大流问题,一般有两条途径。一条途径是先用最大流算法算出最大流,然后根据边费用,检查是否有可能在流量平衡的前提下通过调整边流量,使总费用得以减少?只要有这个可能,就进行这样的调整。调整后,得到一个新的最大流。-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
-
-
0下载:
最大流问题C++实现,对于数学建模或者图像处理领域都有较大帮助。-Maximum flow problem in C++, or in the field of mathematical modeling for image processing have greatly help.
-
-
0下载:
此程序能够解决网络中最小费用最大流问题,内含调试结果及解释。并附有分析流程,结果分析。-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.
-