A method is proposed to solve time-cost trade-off model for activity networks by using the minimum cost flow principle.
提出了利用最小费用流原理求解时间-费用优化模型的方法。
In this paper we discuss the sufficient and necessary conditions for existence of the more-for-less paradox in a minimum cost flow problem.
本文讨论了一般情况下线性规划问题出现“多反而少”现象的一充分必要条件，以及最小费用流问题出现“多反而少”现象的充分必要条件。
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.
本文研究了无容量限制的带固定费用和可变费用的单物资和二物资的最小费用流问题，并分别给出了多项式算法。
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.
本文研究了无容量限制的带固定费用和可变费用的单物资和二物资的最小费用流问题，并分别给出了多项式算法。
应用推荐