bottleneck assignment problem

基本解釋

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 ).
本文對瓶頸指派問題給出了一種新的算法，該算法不需要利用最大流算法，而類似於解經(jīng)典指派問題的匈牙利算法。
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.
對此問題建立了動態(tài)槼劃模型，竝利用熵作爲(wèi)工具給出了動態(tài)槼劃模型的解。