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, 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.
本文研究了无容量限制的带固定费用和可变费用的单物资和二物资的最小费用流问题，并分别给出了多项式算法。
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.
建立了求解铁路局范围内请求车审批优化的数学模型和与此模型对应的网络图，将铁路请求车审批优化问题转换为求解最小费用最大流问题。
Then we construct a capacity cost network from the debt credit degree network. Finally, by applying minimum cost circulation flow problem, we give a polynomial algorithm for this model.
然后由债务信度网络构造了容量费用网络，利用最小费用循环流问题给出了该模型的一个多项式算法。
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.
对分配网络流做了介绍，通过将网络单纯形算法加以推广，得到了一类特殊分配网络流的最小费用流的一种算法。
The reasons causing the above problem are analyzed, and a novel nonlinear minimum cost cycle flow algorithm is presented.
文章分析了造成这一情况的原因，并给出了一种新的非线性最小费用循环流算法。
The reasons causing the above problem are analyzed, and a novel nonlinear minimum cost cycle flow algorithm is presented.
文章分析了造成这一情况的原因，并给出了一种新的非线性最小费用循环流算法。
应用推荐