assignment n. 1.分給,分配。 2.指定,委派。 3.(理由等的)陳述;(錯(cuò)誤等的)指出。 4.(財(cái)產(chǎn)、權(quán)利的)轉(zhuǎn)讓,讓與。 5.讓與證書(shū),委托證書(shū)。 6.〔美國(guó)〕任命;任務(wù),工作;(課外)作業(yè)。 give students assignments 給學(xué)生留作業(yè)。 He left for his assignment in the Middle East. 他去中東赴任。
no problem 毫無(wú)問(wèn)題; 考試家族; 沒(méi)問(wèn)題; 無(wú)問(wèn)題
problem n. 1.問(wèn)題,課題;疑難問(wèn)題;令人困惑的情況。 2.【數(shù)、物】習(xí)題;作圖題。 3.(象棋的)布局問(wèn)題。 the problem of unemployment 失業(yè)問(wèn)題。 His whole conduct is a problem to me. 他的一切行為我都不理解。 adj. 1.成問(wèn)題的;難處理的。 2.關(guān)于社會(huì)問(wèn)題的。 a problem child 【心理學(xué)】問(wèn)題兒童;難管教的孩子。 a problem novel [play] (反映社會(huì)問(wèn)題等的)問(wèn)題小說(shuō)[戲劇]。 sleep on [upon, over] a problem 把問(wèn)題留到第二天解決。
( 4 ) on the above basis , we propose a " priming " algorithm of multi - dimension assignment problem and analyze its mechanism and computation burden 在上述基礎(chǔ)上,提出了多維分配問(wèn)題的一種“剪枝”求解方法,并對(duì)該方法的“剪枝”機(jī)理及計(jì)算量進(jìn)行了詳細(xì)分析。
This paper presents a way using target type as the main property to evaluate threat degree , and using hungarian algorithm to solve the targets assignment problem 本文采用了以目標(biāo)類型為主要屬性的威脅評(píng)估方法,然后運(yùn)用匈牙利算法對(duì)得到的威脅矩陣進(jìn)行目標(biāo)分配。
The essential point of crew management is the crew scheduling . it mainly contains two sub - problems , namely the crew pairing problem and the crew assignment problem 機(jī)組資源的管理重點(diǎn)就是在機(jī)組排班上,機(jī)組排班問(wèn)題主要分為兩個(gè)子問(wèn)題:機(jī)組任務(wù)配對(duì)產(chǎn)生和機(jī)組人員指派。
The assignment problem is a type of sophisticated combinatory designs which are difficult to be solved by the traditional methods , and so is the sequencing problem 指派問(wèn)題和排序問(wèn)題是一類復(fù)雜的組合問(wèn)題,傳統(tǒng)的方法難于解決。相比之下,遺傳算法解決此類問(wèn)題具有優(yōu)勢(shì)。
In previous papers , we established the mathematical model of expert assignment problem , and proposed genetic algorithm and ga using heuristic mutation guide by pheromone to solve eap 實(shí)驗(yàn)證明,遺傳算法是一種可行的途徑,并且信息素指導(dǎo)下的啟發(fā)式變異操作,可以加速算法向最優(yōu)解搜索。
In this paper , a type of multi - commodity location problem is described , which can be changed assignment problem , so it can be solved simply through hungarian method 摘要對(duì)一類多產(chǎn)品設(shè)施選址問(wèn)題進(jìn)行了描述,通過(guò)分析得出該類設(shè)施選址問(wèn)題可轉(zhuǎn)化為分配問(wèn)題,從而可通匈牙利法對(duì)該設(shè)施選址問(wèn)題進(jìn)行簡(jiǎn)便地求解。
Based on the solution space analysis of the quadratic assignment problem , we tried to apply the solution schema to ant system algorithm , and made an experiment on the four classes problem of qap 在對(duì)二次分配問(wèn)題qap解空間地形分析的基礎(chǔ)上,提出了解模式在螞蟻算法中的應(yīng)用,并且在qap的四類問(wèn)題上進(jìn)行了實(shí)驗(yàn)。
( 3 ) to plan the mission path with efficiency , the a algorithm is developed to deal with the attacking mission path . this kind of a algorithm can deals with the targets assignment problems also ( 3 )為了對(duì)航路進(jìn)行有效地規(guī)劃,本文對(duì)啟發(fā)式a ~ *算法進(jìn)行了改進(jìn),并用于無(wú)人機(jī)的攻擊航路規(guī)劃及作戰(zhàn)目標(biāo)的選擇分配問(wèn)題。
It is shown that these four types of single machine scheduling problems can be modeled as an assignment problem by mathematical programming method , thus these four types of problems can be solved in polynomial time 用數(shù)學(xué)規(guī)劃的方法證明了四類多準(zhǔn)則下的單機(jī)排序問(wèn)題可以轉(zhuǎn)化為指派問(wèn)題,從而這四類問(wèn)題都多項(xiàng)式時(shí)間可解。
( 3 ) in this dissertation , we give a uniform model of multi - dimension problem by analyzing the standard model of assignment problem in operational research and the multi - dimension assignment model in data association 通過(guò)對(duì)運(yùn)籌學(xué)中分配問(wèn)題的標(biāo)準(zhǔn)模型及數(shù)據(jù)關(guān)聯(lián)所形成的多維分配模型進(jìn)行比較分析,總結(jié)出了多維分配問(wèn)題數(shù)學(xué)模型的統(tǒng)一表達(dá)形式。
The assignment problem is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics. It consists of finding a maximum weight matching in a weighted bipartite graph.