Learn More
An efficient method for solving Linear Bottleneck Assignment problems is described. The method starts with a heuristically determined partial assignment. Then shortest augmenting paths are constructed with the aid of a modification of the algorithm of Dijkstra. Comprehensive numerical investigations are reported and discussed. A FORTRAN IV subroutine can be(More)
We analyse two strategies for solving the bottleneck assignment problem — the threshold method and the shortest augmenting path concept —, show their theoretical equivalence and computational behaviour. We develop a new rather efficient labeling technique to be used in the shortest augmenting path method and a hybrid procedure combining the advantages of(More)