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.
然后由债务信度网络构造了容量费用网络，利用最小费用循环流问题给出了该模型的一个多项式算法。
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.
以国际标准CRC-CCITT循环冗余校验码为研究对象，利用近世代数多项式理论证明其奇偶校验性质、最小码距和纠正单比特错误能力。
In this dissertation, a line extraction method based on cubic polynomial interpolation and minimum mean square error fitting are proposed, which can effectively extract lines out.
本文采用三次多项式插值和曲线拟合相结合的方法可简单有效地提取出在线掌纹的线特征。
In the case of(Char(F_q), |G|)=1, we provide a method that writing down directly all the primitive idempotents of related polynomial ring, and hence that of all the minimum cyclic codes.
当有限域的特征不整除群的阶时，给出了直接写出相应的多项式环的本原幂等元的方法，从而可以直接写出所有的极小循环码。
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.
建立了求解铁路局范围内请求车审批优化的数学模型和与此模型对应的网络图，将铁路请求车审批优化问题转换为求解最小费用最大流问题。
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.
建立了求解铁路局范围内请求车审批优化的数学模型和与此模型对应的网络图，将铁路请求车审批优化问题转换为求解最小费用最大流问题。
应用推荐