integer-program

常見(jiàn)例句

• The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO.
  求解最小生成樹(shù)的方法雖然很多,但是利用LINGO建立相應(yīng)的整數(shù)規(guī)劃模型是一種新的嘗試。
• The learning approach leads to a hard mixed integer program that can be solved iteratively in a heuristic optimization.
  使用迭代的啟發(fā)式最優(yōu)化算法來(lái)解決多例學(xué)習(xí)中復(fù)雜的整型規(guī)劃問(wèn)題，以使分類風(fēng)險(xiǎn)最小化。
• The only general solution is linear or integer programming.
  唯一通行的解決方法是線性規(guī)劃或者整數(shù)規(guī)劃。
• In this paper the VP route program problem(VPR)in ATM networks is analyzed The problem is transformed into a kind of bottleneck multiple choice integer program problem(BMCIP).
  本文對(duì)ATM網(wǎng)絡(luò)虛通道路由規(guī)劃問(wèn)題(VPR)進(jìn)行了分析，并將此類問(wèn)題轉(zhuǎn)化為一類瓶頸多選擇整數(shù)規(guī)劃問(wèn)題(BMCIP)，針對(duì)此類問(wèn)題特點(diǎn)提出了一種新的有效的求解方案。
• The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO. There are particular notes to the difficulties of the model.
  本文利用樹(shù)根和節(jié)點(diǎn)級(jí)數(shù)的概念 ,借助于LINGO建立了求解最小生成樹(shù)的整數(shù)規(guī)劃模型 ,并對(duì)模型中的難點(diǎn)給出了詳細(xì)的注釋。
• Then, the four procedures of controller synthesis, namely, the constraint transformation method (CTM), the eigen marking method (EMM), the linear integer program method (LIP) and the extended linear integer program method (ELIP) are discussed one by one.
  接著研究了四種具體的控制器綜合方法，即約束變換法、特征標(biāo)識(shí)法、線性整數(shù)規(guī)劃法和擴(kuò)展線性整數(shù)規(guī)劃法。
返回 integer-program