combination optimization problem with constraints
combination optimization problem with constraints
带约束的组合优化问题
以上为机器翻译结果，长、整句建议使用 人工翻译 。
-
Timetabling Problem (TP) is a Multiobjective Combination Optimization Problem with constraints, and also has been proved NP-Completed.
排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个NP完全问题。
youdao
更多双语例句