Timetabling Problem (TP) is a Multiobjective Combination Optimization Problem with constraints, and also has been proved NP-Completed.

排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个NP完全问题。

youdao

Timetabling Problem (TP) is a Multiobjective Combination Optimization Problem with constraints, and also has been proved NP-Completed.

排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个NP完全问题。

youdao