This article researches the way-network capacity and the minimum time flow at the aspect of the blocking flow.
本文从堵塞流的角度来研究路网容量和最短时间流问题。
In this paper, the minimum cost flow problem with fuzzy constraint is proposed for the first time, and the corresponding mathematical model is constructed.
本文首次提出了带模糊约束的最小费用流问题，建立了相应的数学模型并给出了求解这一模型的有关算法。
A method is proposed to solve time-cost trade-off model for activity networks by using the minimum cost flow principle.
提出了利用最小费用流原理求解时间-费用优化模型的方法。
应用推荐