基本解釋[數(shù)] 組合優(yōu)化英漢例句雙語例句Job-shop Scheduling Problem is a typical NP problems, which is one of the hardest combinatorial optimization problem.作業(yè)車間調(diào)度問題是一個典型的NP 難問題，是最困難的組合優(yōu)化問題之一。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.我選擇，上海交通大學(xué)繼續(xù)我的學(xué)習(xí)為其最佳的信譽(yù)在組合優(yōu)化與網(wǎng)絡(luò)調(diào)度在我的研究興趣所在。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.通過在具體實例中的應(yīng)用表明，采用遺傳算法為有效地解決這一復(fù)雜組合優(yōu)化問題提供了一種新途徑。combinatorial optimization更多例句詞組短語短語Combinatorial l Optimization 組合優(yōu)化combinatorial optimization problems 組合最佳化問題;屬于組合最佳化問題combinatorial optimization algorithm 組合優(yōu)化算法Computational Combinatorial Optimization 計算組合優(yōu)化優(yōu)化或可證實近優(yōu)化方案Combinatorial Optimization Genetic Algorithm 組合優(yōu)化遺傳算法combinatorial optimization更多詞組