把燃料计划问题转换为网络的最小费用流问题来求解。
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.
本文研究了无容量限制的带固定费用和可变费用的单物资和二物资的最小费用流问题，并分别给出了多项式算法。
We study uncapacitated version of the minimum cost flow problem of one-commodity and two-commodity with not only fixed cost but also variable cost, and give them each a polynomial algorithm.
本论文着力针对全球区域经济间港口集装箱运输网络系统的最小费用流问题，研究运用现代优化方法来合理配置集装箱的跨洋运输。
This paper, focusing on the problem of the minimum cost in the regional containers transport network, does research on modern optimal method to deploy the overseas container transportation reasonably.
本文讨论了一般情况下线性规划问题出现“多反而少”现象的一充分必要条件，以及最小费用流问题出现“多反而少”现象的充分必要条件。
In this paper we discuss the sufficient and necessary conditions for existence of the more-for-less paradox in a minimum cost flow problem.
本文讨论了一般情况下线性规划问题出现“多反而少”现象的一充分必要条件，以及最小费用流问题出现“多反而少”现象的充分必要条件。
In this paper we discuss the sufficient and necessary conditions for existence of the more-for-less paradox in a minimum cost flow problem.
应用推荐