bottleneck assignment problem

基本解釋

• [計(jì)算機(jī)科學(xué)技術(shù)]阻塞分派問(wèn)題

英漢例句

雙語(yǔ)例句

• In this paper, we give a new algorithm for the bottleneck assignment problem on the basis of Knig s theorem, and show that the time complexity of the algorithm is O(n 3 ).
  本文對(duì)瓶頸指派問(wèn)題給出了一種新的算法，該算法不需要利用最大流算法，而類似於解經(jīng)典指派問(wèn)題的匈牙利算法。
• In this paper, a dynamic programming model of them-dimensional bottleneck assignment problem is established, also a suitable solution of this model is given based on entropy.
  對(duì)此問(wèn)題建立了動(dòng)態(tài)槼劃模型，竝利用熵作爲(wèi)工具給出了動(dòng)態(tài)槼劃模型的解。

• bottleneck assignment problem更多例句

專業(yè)釋義

計(jì)算機(jī)科學(xué)技術(shù)

• 阻塞分派問(wèn)題