1) polynomial algorithm
多项式算法
1.
In this paper,we consider a special integer bottleneck problem,and present two polynomial algorithms.
研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。
2.
A strong polynomial algorithm is proposed to solve the problem.
讨论了此类问题的特性 ,并给出了解决问题的一个强多项式算法 。
3.
Also, we represent the polynomial algorithms relevant to these cases.
对以最大滞后时间以及带权加工时间和为第二优化目标的动态单机排序问题１｜ｒｊ｜Ｃｍａｘ分别进行了探讨，并给出了相应的多项式算法。
2) polynomial time algorithm
多项式算法
1.
SDNM is a polynomial time algorithm with the Newton s method, so that SDNM can solve large-scale linear inequalities.
它在理论上是多项式算法 ,并可以从任意点启动 ,可以应用共轭梯度方法有效地求解大规模线性不等式组问题。
2.
A polynomial time algorithm is developed for the restricted version in which the jobs in each group have the same due date.
对同组工件有相同工期的限制情形给出了一个多项式算法。
4) polynomial algorithms
多项式算法
1.
The following objective function is considered: the maximum completion time(makespan),and the polynomial algorithms are presented for the problem.
针对一类带有准备时间和安装时间的单机成组排序问题,给出了求解最优排序的多项式算法。
5) polynomial-time algorithm
多项式时间算法
1.
In this paper,we gave two polynomial-time algorithms for solving two special unit type shortest path improvement problems under Hamming distance in single-source arborescence,and we studied some properties of the general problem.
给出了求解两类特殊的Hamming距离下单位型单发点树型网络最短路改进问题的多项式时间算法,并研究了一般树型网络下该问题的性质。
2.
Finally a polynomial-time algorithm for the optimal strategy of OEM is gotten by using dual theory of bilevel programming.
最后,利用双层规划的对偶理论,给出求解OEM业务最优策略的一种多项式时间算法。
3.
It is shown that this algorithm is a polynomial-time algorithm which can algorithm can find anε-approximate solution in O(n~(1/2)lnε~(-1)) iterations.
给出二次锥规划的一种不可行内点算法并证明该算法是多项式时间算法。
6) polynomial time algorithm
多项式时间算法
1.
A polynomial time algorithm for the scheduling problem of identical coupled-task jobs is presented in.
本文讨论并给出了由n个相同的耦合工件构成的耦合工件组作业问题的多项式时间算法。
2.
To present a new polynomial time algorithm for China traveling salesman problem, first, point set was partitioned into a number of subpoint sets by using convex hull and medial axis.
研究求解中国货郎担问题最短回路的多项式时间算法。
3.
In this paper,we will prove that there exit an orthogonal matching decomposition of M in simple bipartite graph,and present a polynomial time algorithm of this decomposition.
在本文中我们将证明对于简单二部图G,存在关于完美匹配M的正交匹配分解,并给出了求这个分解的多项式时间算法。
补充资料：多项式乘多项式法则
Image:1173836820929048.jpg
多项式乘多项式法则
先用一个多项式的每一项乘以另一个多项式的每一项，再把所得的积相加。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。