Convex analysis, Lagrangian relaxation, nondifferentiable optimization, and applications in integer programming.
凸分析、拉格朗日松弛法、不可微分函数最适在整数规划上应用。
Convex analysis, Lagrangian relaxation, nondifferentiable optimization, and applications in integer programming.
凸分析、拉格朗日松弛法、不可微分函数最适在整数规划上应用。
The PSO algorithm is a new evolutionary computation method which is applicable to complex optimization problems that are nonlinear, nondifferentiable and multimodal.
微粒群算法是一种新算法,它能有效地解决非线性、不可微、多峰优问题。
声明:上例句、词性分类均由互联网资源自动生成,部分未经过人工审核,其表达内容亦不代表本软件观点;若发现问题,欢迎向我们指正。