把燃料计划问题转换为网络的最小费用流问题来求解。
So we can convert the realistic fuel planning into a minimum cost flows problem and find the answer ultimately.
提出了利用最小费用流原理求解时间-费用优化模型的方法。
A method is proposed to solve time-cost trade-off model for activity networks by using the minimum cost flow principle.
本文提中一种最小费用流算法，实现从两个正交的一维投影重建图象。
A new minimum cost network flow algorithm is described for the image reconstruction from their two orthogonal 1-d projections.
本文提出了可调圈的概念，并力图对最小费用流问题的多重最优解进行一些探讨。
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 described the distribution network flow and get an algorithm of minimum cost flow about a special distribution network flow problem by extending the network simplex method.
本文研究了无容量限制的带固定费用和可变费用的单物资和二物资的最小费用流问题，并分别给出了多项式算法。
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.
网络最大流与最小割集的矩阵算法，不仅能解决许多这类问题，而且能使最小费用流、分配问题和运输问题容易通过计算机来实现。
Matrix arithmetic of network maximal flux and minimal separate set not only solves these problems, but also solves some other problems by the computer such as minimal fee, distribution and transport.
本论文着力针对全球区域经济间港口集装箱运输网络系统的最小费用流问题，研究运用现代优化方法来合理配置集装箱的跨洋运输。
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.
本文主要讨论了生产网络流的最小费用问题，在研究该问题的基本结构及其对偶性质的基础上给出了该问题的网络单纯形法。
The infrastructure and dual properties of the so-called minimum cost problem are specifically studied to outline a network simplex method for solving this problem.
在此基础上以运输成本最小化为二级目标建立模型，将其转化成带有分层的网络流模型，用最小费用最大流算法进行求解。
On this basis, in order to minimize the two objectives of the transport costs to model, to convert it into a network flow model with a stratified, with the minimum cost maximum flow algorithm.
首先对给定的数据流图进行单电压高层次综合，然后对单电压综合结果迭代地进行多电压调整；提取每次迭代时需要调整的网络流子图，对该子图运行最小费用最大流增量算法。
The network flow sub-graph needed to adjust is extracted from the previous network flow graph and the min-cost max-flow augmentation algorithm is run on it.
首先对给定的数据流图进行单电压高层次综合，然后对单电压综合结果迭代地进行多电压调整；提取每次迭代时需要调整的网络流子图，对该子图运行最小费用最大流增量算法。
The network flow sub-graph needed to adjust is extracted from the previous network flow graph and the min-cost max-flow augmentation algorithm is run on it.
应用推荐