In this paper, we consider a special integer bottleneck problem, and present two polynomial algorithms.
研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。
Using the similarity between polynomial ring and integer ring the paper establishes Sunse's Theorem in the polynomial ring in number field, and offers its brief learning and practice.
利用数域上一元多项式环与整数环相似的性质，建立数域上一元多项式环中的孙子定理，并给出它的简单应用。
Furthermore, the integer programming method is exploited as the mathematical tool for the generation of a polynomial algorithm producing the optimal set elementary siphons.
在此基础上，以整数规划算法为数学工具给出了时间算法复杂度为多项式的最优基本信标的计算方法。
Rapidly generating parametric polynomial surface was discussed, a fast algorithm of generating parametric polynomial surface was given which is based on integer addition and subtraction.
讨论了参数多项式曲面的快速生成。给出了用整数加减法逐点生成参数多项式曲面的快速算法。
An integer programming formulation for channel assignment problem with channel loading is presented and polynomial time algorithms are designed for some special radio networks in this paper.
给出了具有频道负荷约束的专用移动无线电网络问题的整数线性规划，设计了求解特殊网络的具有频道负荷约束的频道分配问题的多项式时间算法。
An integer programming formulation for channel assignment problem with channel loading is presented and polynomial time algorithms are designed for some special radio networks in this paper.
给出了具有频道负荷约束的专用移动无线电网络问题的整数线性规划，设计了求解特殊网络的具有频道负荷约束的频道分配问题的多项式时间算法。
应用推荐