Tang Chun-xia
Abstract
For the 1-dimensional bottleneck assignment problem, the predecessors had some research work, based on which, in this paper, we discussed and studied a 2-dimensional bottleneck assignment problem. For this problem, we established a dynamic programming algorithm with threshold.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For the 1-dimensional bottleneck assignment problem, the predecessors had some research work, based on which, in this paper, we discussed and studied a 2-dimensional bottleneck assignment problem. For this problem, we established a dynamic programming algorithm with threshold.
Key concepts: Bottleneck, Linear bottleneck assignment problem, Computer science, Algorithm, Mathematical optimization, Dynamic programming, Assignment problem, Generalized assignment problem