The presented method is more accurate for using polynomial regression of theoretical calculated data as sample off-line and is quicker for the reason of its fixed polynomial pattern on-line.

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.

The transport problem with fixed charge is a kind of NP problem, and there is no polynomial algorithm which can solve it.