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.

然后由债务信度网络构造了容量费用网络，利用最小费用循环流问题给出了该模型的一个多项式算法。

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

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.

以国际标准CRC-CCITT循环冗余校验码为研究对象，利用近世代数多项式理论证明其奇偶校验性质、最小码距和纠正单比特错误能力。

youdao