无容量限制的最小费用流问题

Uncapacitated Minimum Cost Flow Problem

中文关键词:  最小费用  网络流  固定费用

英文关键词:minimum cost  network flow  fixed cost.

中文摘要:

      本文研究了无容量限制的带固定费用和可变费用的单物资和二物资的最小费用流问题,并分别给出了多项式算法.最后应用该算法,计算了一个二物资的最小费用流问题的实例.

英文摘要:

      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. Moreover, we solve an example of uncapacitated two-commodity minimum cost flow problem with the algorithm.