本文研究了广义上界问题的反问题及广义最大流问题的反问题。
This article discusses the inverse generalized upper bounding problem and generalized maximum flow problems.
介绍了最大流问题的多解，提出了通过调整圈来求解最小费用最大流的方法。
This paper introduce multiple solutions to maximal flows and, by adjusting circle, presents a simple approach to work out maximal flows at lowest cost.
本文对网络中最大流问题的求法进行了探索。利用画树图，给出了网络最大流的生长树求法。
The research is made in this article on evaluation of maximal flow in network, giving the growth tree evaluation on maximal flow of network by drawing the tree map.
应用推荐