以深度优先搜索作为基本算法，用路径删除和结点删除方法产生多重解，用最小成本法求出最优解。
Based on depth first search, the article USES route deletion and node deletion methods to produce multi-solutions, and then determine the optimum solution with least costing.
通过分析soc参数的基本属性，利用邻域搜索算法针对功耗进行自动参数优化，得到性能和功耗的最优解。
For obtaining the optimum performance and power, based on the property analysis of SOC parameters, a neighborhood-region-search algorithm was presented to optimize the selection of parameters.
在一般的假设条件下 ，我们应用性能势的基本性质直接建立了无限时间水平平均代价模型的最优性方程 ，并且证明了在紧致集上最优解的存在性 。
Under a general assumption, we establish directly the optimality equation for infinite time horizon average cost model and prove the existence of optimal solution in a compact action set by using p.
为了高效可靠地获得全局最优解，对基本遗传算法进行了改进。
In order to obtain the global solution efficiently and robustly, the basic GA is improved.
因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。
Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached.
该类算法的基本思想是通过求解一系列二次函数在信赖域中的极小值点逼近最优化问题的解。
The basic idea of these methods is to approximate the optimization problem by a sequence of quadratic minimization problems subject to some trust region.
该类算法的基本思想是通过求解一系列二次函数在信赖域中的极小值点逼近最优化问题的解。
The basic idea of these methods is to approximate the optimization problem by a sequence of quadratic minimization problems subject to some trust region.
应用推荐