...1 最短路问题(shortest path problem)2.1.2 最大流问题(maximum flow problem)2.1.3 最小成本流问题(minimum cost flow problem)<< 查看详细目录
基于24个网页-相关网页
minimum cost network flow problem 最小费用流问题
minimum-cost maximum flow problem 最小费用最大流问题
minimum cost maximum flow problem 最小费用最大流问题
minimum cost circulation 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.
本文讨论了一般情况下线性规划问题出现“多反而少”现象的一充分必要条件，以及最小费用流问题出现“多反而少”现象的充分必要条件。
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.
本文研究了无容量限制的带固定费用和可变费用的单物资和二物资的最小费用流问题，并分别给出了多项式算法。
应用推荐