查询词典 discrete optimization problem

Delay constrained multicast problem is an important part of multipoint routing optimization problem and has been proved to be a NP-Complete problem.

有时延约束的组播问题是通信网络多点路由优化问题中的重要部分，已被证明是NP complete问题。

Ramsey number problem is a famous optimization problem, and is also a NP complete problem.

Ramsey数问题是一个著名的组合优化问题，同时也是一个NP完全问题。

The event-tree based modeling and optimization algorithms are adopted and the whole problem is divided into two sub problems (the portside sub problem and the refinery sub problem).Thus, the algorithm is proposed by analyzing the solving sequence of the two sub problems.

该方法把原油混输调度问题分解为码头调度子问题和厂区调度子问题，采用基于事件树的建模方法，并根据两个子问题的求解顺序提出了原油混输调度问题的分布式并行算法。

Until recently, the convergence of the Rosen"s arithmetic has been proved. The projection gradient method is the generalization of Steepest decent method to constraint problem. So it does have a faster convergence speed that the fastest decent method . To solve the problem, many researchers have generalizat the well-developed optimization with unconstraint to the Rosen"s gradient method. The conjugate gradient method is one of success to solve the problem.

投影梯度法是最速下降法对约束问题的推广，因此没有较快的收敛速度，为了解决这个问题很多中外学者把发展得比较成熟的无约束最优化算法作类似的推广，其中共轭梯度方法是近年发展的很成熟的方法，它具有计算简单，算法结构好，计算量少，具有良好的收敛性等优点，而Rosen投影梯度法的提出使寻找下降方向变得简单。

The slab sequencing problem in hot strip production is a complex combination optimization problem.It can be formulated as Prize Collecting Traveling Salesman Problem.

热轧带钢生产中的板坯排序是一种复杂的组合优化问题，可以归结为一个PCTSP问题。

It is known that a production sequencing problem in mixed-model assembly line falls into NP-hard class of combinatorial optimization problem and thus a large-sized problem may be computationally intractable.

本文应用一种解大规模组合优化问题，特别是NP完全组合优化问题的有效近似算法——模拟退火算法，来求解混流生产线的投产排序问题，克服了上述缺点。

With the idea of smoothing Newton method, we propose a new class of smoothing Newton methods for the nonlinear complementarity problem based on a class of special functions. In this paper, complementarity problem is converted into a series of smoothing nonlinear equations and a modified smoothing Newton algorithm is used to solve the equations. We use Newton direction and Gradient direction together in the algorithm which guarantees that our method is globally convergent. Also using another smoothing function, we reformulate the generalized nonlinear complementarity problems defined on a polyhedral cone as a system of smoothing equations and a smooth unconstrained optimization problem. Theoretical results that relate the stationary points of the merit function to the solution of the generalized nonlinear complementarity problems are presented, we use the modified smoothing Newton algorithm in generalized nonlinear complementarity problems, under mild hypothesis, a global convergence is proved.

本文一方面基于现有的各种光滑Newton法的思想和半光滑理论，利用著名的F-B互补函数的光滑形式，首先将互补问题的求解转化为求解一系列光滑的非线性方程组，然后给出了一种修正的光滑Newton法，该方法不仅放宽对函数F的要求，在Newton方程不可解时引入初始效益函数的最速下降方向，而且光滑因子的选择也比较简单可行，同时在适当的条件下，证明了其算法具有全局收敛性；另一方面，借助另一种F-B光滑函数，将多面体锥上的广义互补问题转化为一种光滑形式，讨论了优化问题的稳定点与广义非线性互补问题的解之间的理论关系，并将这种修正的光滑Newton法用于求解广义非线性互补问题中，在适当的条件下，该算法同样具有全局收敛性。

By introducing a smooth merit function for linear inequalities system problem, the problem was equivalently reformulated as an unconstraint optimization problem.

通过引入线性不等式组问题的一类光滑价值函数，将其求解问题等价地转化为无约束优化问题的求解。

Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.

最大团问题是一个经典的NP难的组合优化问题，很多实际问题都可以抽象为对无向图上最大团问题的求解，所以，对最大团问题的研究无论在理论上还是实际上都有重要意义。

The QoS multicast routing optimization problem was changed into a quasi-continuous problem by using a node series encoding method. Constrained terms in the problem were processed by the penalty function.

该算法采用一种节点序列编码方案，将路由优化问题转化成一种准连续优化问题，并采用罚函数处理约束条件。

The teacher likes the honeymouthed little girl very much.

老师很喜欢这个嘴甜的小姑娘。

Mr. Notker Bien's interests are traveling, spending quality time with the family and long-distance-running.

诺特卡·柏恩先生热爱旅游，长跑，以及和家人一起共度美好时光。