Automatic Test Paper is a combination of multi-objective constrained optimization problem.
智能组卷是一个多约束目标的组合优化问题。
Function optimization experiments show that which operator works better in an algorithm depends on both the combination capability of the operator and the problem to be optimized.
函数优化实验研究表明，在算法中采用何种离散重组算子较为合适与算子的组合能力有关，也与优化问题有关。
In this paper, the NP-complete problem in combination and optimization having been solved with DNA computing is mainly introduced, and the complexity of these methods is analyzed briefly.
主要介绍了目前利用DNA计算已经解决的组合优化中的NP -完全问题，并简单地分析了它们的复杂性。
应用推荐