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.

本文研究了无容量限制的带固定费用和可变费用的单物资和二物资的最小费用流问题，并分别给出了多项式算法。

youdao

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.

建立了求解铁路局范围内请求车审批优化的数学模型和与此模型对应的网络图，将铁路请求车审批优化问题转换为求解最小费用最大流问题。

youdao