combinatorial optimization

基本解释

Job-shop Scheduling Problem is a typical NP problems, which is one of the hardest combinatorial optimization problem.
作业车间调度问题是一个典型的NP 难问题，是最困难的组合优化问题之一。
I selected the Shanghai Jiao Tong University to continue my study for its best reputation on Combinatorial Optimization and Network Scheduling where my research interest lies.
我选择，上海交通大学继续我的学习为其最佳的信誉在组合优化与网络调度在我的研究兴趣所在。
By the application in a concrete sample, it is indicated that the genetic algorithm provides a new way to solve this complicate combinatorial optimization problem effectively.
通过在具体实例中的应用表明，采用遗传算法为有效地解决这一复杂组合优化问题提供了一种新途径。