查询词典 problem on obstacle

Then, we construct a network model of the max-min spanning arborescence problem, we discuss the essential character of the max-min spanning arborescence and deduce an effective algorithm to solve this problem based on the relationship between the minimum in-arc circuit and the max-min spanning arborescence.

3最大最小树形图问题，即基于实际背景，建立求网络的最大最小树形图的模型，研究最大最小树形图的基本性质，并以最小入弧回路与最大最小树形图的关系为基石，介绍求网络的最大最小树形图的有效算法。

"Zhang Jian Qiu count as" Communication is the question 92, the achievements of the more prominent and there is the common denominator least common multiple of the calculation, the arithmetic progression of the problem to solve, some uncertainties, such as problem solving equation.

张丘建算经》现传本有92问，比较突出的成就有最大公约数与最小公倍数的计算，各种等差数列问题的解决、某些不定方程问题求解等。

Pay attention to the immanent connection of meantime, hold the significance between them correctly, seek the articulatory dot that solves a problem and breakthrough site, should be a kind of train of thought that solves a problem.

注重其间的内在联系，正确把握它们之间的关系，寻找解决问题的关节点和突破点，应该是解决问题的一种思路。

With respect to this problem, become bit of explanation to everybody, PR is Gu Ge a search engine evaluation to the importance of the website (everybody knows, excuse me is not burdensome), want to accomplish 3 months left and right sides, ability calls significant link, just can increase a website at most otherwise collect, and the time that make a station is not 9 months have PR, of course this is a few circumstance only, also have do a station to be less than March have very tall PR, sure we are not the ascarid inside their abdomen, what do not know they are used is what method (even the attention that somebody gets a government to stand), moral problem remains examine and verify!

就这个问题，给大家做点解释，PR是谷歌搜索引擎对网站的重要性的一个评价，要做到3个月左右，才能称为有效的连接，不然只是最多能增加网站的收录，而且做站时间不是一两个月就有PR的，当然这只是少数情况，也有做站不到3月的就有很高PR的，必定我们不是他们肚子里面的蛔虫，不知道他们用的是什么方法(甚至有人搞政府站的注意)，道德问题有待审核！

Assignment problem is a kind of classical problem in operation research and has been widely used in productive practice.

指派问题是运筹学中的一类经典问题，在生产实践中有广泛的应用。

In this paper, we classify it as a problem of production assignment and propose a linear programming model to solve the problem.

论文将其归结为生产的指派问题，并将用户的需求和企业的产出量化，通过提出的一个模型给以解决。

The assignment problem is one of combinatorial optimization problems. simulated annealing algorithm can be used to solve assignment problem.

指派问题是组合优化问题中的一种，可用模拟退火算法来解此问题。

In Chapter eight the transportation problem and the assignment problem are both examined.

在第八章，检验了运输问题和分配问题。

However, the second associated Legendre function is too complicated to compute, so a simple and practical ellipsoidal harmonic series expansion is introduced, and the series solution and integral solution of the Dirichlet boundary value problem and the Neumann boundary value problem under ellipsoidal boundary are given.

鉴于展开式中第二类缔合勒让德函数的计算较为复杂，接着引入一种形式简单、实用的椭球谐级数展开，介绍了椭球界面下Dirichlet边值问题和Neumann边值问题的级数解和积分解。

Basing on this, the formal asymptotic expansion of solution for the original problem is obtained. Finally, under suitable conditions, existence and its uniform validity of asymptotic expansion of solution for the initial boundary value problem are proved,by using theory of differential inequalities.

在这基础上得到了原问题解的形式渐近展开式；最后，在适当的条件假设下，利用微分不等式理论，证明了原初边值问题解的存在性及其渐近展开式的一致有效性。

You can buy sweetened beverages, if that suits you.

你若喜欢的话，可以买些含有糖精的混合饮料。

As many of you are probably aware, Nick and Vanessa were recently faced with an embarrasing sex scandal after naked pictures of the two getting jiggy with it in a hot tub surfaced the net.

正如很多你可能知道，尼克和 Vanessa 最近面临一个尴尬的绯闻事件后，赤裸裸的图片两个越来越jiggy与它在浴缸中的一个热点浮现净。