...规划的求解技术可分为: 1,约束满意问题(Constraint Satisfaction Problems) 2,约束最优化问题(Constraint Optimization Problems) 3,超约束问题(Over-Constrained Problems) 4,约束解题(Constraint Solving) 4.13.1约束满意问题 约束满意问题可定义为:一组变数...
基于16个网页-相关网页
Two mathematical optimization algorithms including simplex method and simulated annealing are used to solve the constraint optimization problems.
介绍了多唯下降单纯形和模拟退火法两种数学优化算法。
The updating problems of structure models are turned into the optimization with a quadratic constraint.
该方法将模型修正问题转化为一个带二次约束的最优化问题。
Container loading is the three-dimensional problem in "cutting and packing" problems. It is combined optimization with complex constraint condition.
集装箱装入问题是“切割和装入”问题领域中的三维空间问题，是具有复杂约束条件的组合优化问题。
应用推荐