... 最大流问题（maximum flow problem） 最小费用流问题（minimum cost network flow problem） 最短路问题（shortest path problem） ...
基于64个网页-相关网页
把燃料计划问题转换为网络的最小费用流问题来求解。
So we can convert the realistic fuel planning into a minimum cost flows problem and find the answer ultimately.
本文提出了可调圈的概念，并力图对最小费用流问题的多重最优解进行一些探讨。
This paper proposes the concept of adjustable loop and tries to make some rudimentary study of the multiple optimum-solution of minimum cost 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.
应用推荐