该词条未找到_海词词典

您要查找的是不是：

An equation or inequality relating the variables in an optimization problem. 在优化问题中，一种表示若干变量相互关系的方程(式)或不等式。
Again, this is a multi-variate optimization problem. 这也是一个多变量的最优化问题。
Layout problem is a combinatory optimization problem. 布局问题是一个组合最优化问题。
The TSP is a classic combinatorial optimization problem. TSP是经典的组合优化问题。
The truck dispatching can be taken as a multivariable optimization problem. 卡车调度可以化为一个受多变量影响的最值问题。
Task allocation problem is a typical combinatorial optimization problem. 任务分配问题是一类典型的组合优化问题。
Algorithms based on trust regions have been shown to be robust for unconstrained optimization problems. 摘要信赖域方法是解无约束优化问题的有效的和可靠的方法。
In economic optimization problems the variables involved are almost always subject to certain contrains. 在经济学最优化问题中所含的变量差不多总是带有某种约束条件。
The optimizing problems of nonlinear functions are discussed. 摘要研究非线性函数的优化问题。
In economic optimization problems the variables involved are almost always subject to certain constrains. 在经济学最优化问题中所含的变量差不多总是带有某种约束条件。
These kinds of optimization problems aren't restricted to "tricky" floating-point code. 这些种类的优化问题并不局限于“棘手”的浮点代码。
Firstly, implicit complementarity problems (Abbr. ICP) is introduced by some optimization problems such as linear programming, quadratic programming. 首先通过线性规划、二次规划等最优化问题引出了文章要解决的对象。
Quasi-Newton methods are welcome numerical methods for solving optimization problems. 在求解无约束最优化问题的众多算法中;拟牛顿法是颇受欢迎的一类算法.
The algorithm is suit for handling the complex and nonlinear optimization problems. 该算法适合处理非线性优化问题。
For some special cases, the deterministic convex optimization problems are derived. 对某些特殊的情形，我们导出了鲁棒线性最优化的确定性等价问题。
COOOL is a package of tools for writing optimization code and solving optimization problems. COOOL是一个软件包工具，它编写优化代码并且解决优化问题。
The last chapter focuses on a class of optimization problems with fuzzy relation in-equality(FRI) constraints. 第四章的主要研究对象是一类具有模糊关系约束的优化问题,称为模糊关系约束优化(FRCO)。
The PHD thesis is to study the super-memory gradient methods for optimization problems. 本文研究非线性最优化中的超记忆梯度算法。
The VRP and the network flow problem are all famous network optimization problems. 车辆路径问题和网络流问题都是非常著名的网络优化问题。
The Chinese Traveling Salesman Problem(CTSP)is one of combinatorial optimization problems, and is a NP. 中国旅行商问题是一个组合优化问题,是一个NP问题。