- 組合最優(yōu)化問題
- optimization: n. 最佳化，最優(yōu)化。
- problem: n. 1.問題，課題；疑難問題；令人困惑的情況。 2.【 ...
- combinatorial optimization: 組合優(yōu)化; 組合最優(yōu)化
- combinatorial problem: 組合問題; 組合最優(yōu)化問題
- journal of combinatorial optimization: 優(yōu)化組合雜志
下載手機(jī)詞典可隨時隨地查詞查翻譯
combinatorial optimization problem中文什么意思
- 組合最優(yōu)化問題
下載手機(jī)詞典可隨時隨地查詞查翻譯
例句與用法
- 更多例句： 上一頁 下一頁
- The cast grouping and ordering problem of steelmaking continuous casting hot rolling ( sm - cc ) is a combinatorial optimization problem
摘要煉鋼-連鑄生產(chǎn)的澆次組合與排序是帶有工藝約束的并行機(jī)流水車間調(diào)度問題。 - The optimization of gear parameters in designing movements of clocks and watches is a combinatorial optimization problem . it is difficult to solve the problem
鐘手表機(jī)芯設(shè)計(jì)中齒輪參數(shù)的優(yōu)化設(shè)計(jì)問題是一個組合優(yōu)化問題,很難用傳統(tǒng)優(yōu)化方法解決。 - Scheduling is one kind of important combinatorial optimization problem , which use some processors , machines or resources to accomplish optimally a batch of given tasks or jobs
排序問題研究的是若干個任務(wù)要在一些機(jī)器上進(jìn)行加工，如何安排機(jī)器和任務(wù)使得某些要求(目標(biāo)函數(shù))達(dá)到最優(yōu)的問題。 - Recently , genetic algorithm has been tyied to resolve variable combinatorial optimization problems , such as job scheduling problem , but but has began just now in vsp
近些年來，人們在用遺傳算法解決現(xiàn)實(shí)中的各種組合優(yōu)化問題上進(jìn)行了探索，如在生產(chǎn)調(diào)度問題中的應(yīng)用，但在車輛調(diào)度問題中的應(yīng)用才剛剛開始。 - In the rest of the thesis , we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems . in chapter 2 , we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems
在第二章至第五章中，我們分別研究了四個組合優(yōu)化問題的近似算法，并給出了它們的性能分析。