Constructing a simple network and converting the allocation problem into the min-cost max-flow in the network, we have developed an optimal algorithm for the allocation problem.

我们构造了一个简单网络，将布点问题转化为该网络中的最小费用最大流问题，从而给出了求解布点问题的最优性算法。

youdao

With the method, a Delay-tolerant Network(DTN) max flow problem can be easily converted to a static network problem, and be solved by traditional algorithms.

容迟网络中的最大流问题被转化为静态网络中的问题，从而可用最大流方案进行求解。

youdao

With the method, a Delay-tolerant Network(DTN) max flow problem can be easily converted to a static network problem, and be solved by traditional algorithms.

容迟网络中的最大流问题被转化为静态网络中的问题，从而可用最大流方案进行求解。

youdao