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.
然后由债务信度网络构造了容量费用网络，利用最小费用循环流问题给出了该模型的一个多项式算法。
2
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 polarities check ability, minimum code distance and capacity of correct single bit error of CRC-CCITT are proved by using galois field polynomial theory.