基本解释

• [计算机科学技术]阻塞分派问题

英汉例句

双语例句

• 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 ).
  本文对瓶颈指派问题给出了一种新的算法，该算法不需要利用最大流算法，而类似于解经典指派问题的匈牙利算法。
• 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.
  对此问题建立了动态规划模型，并利用熵作为工具给出了动态规划模型的解。

专业释义

计算机科学技术

• 阻塞分派问题