Abstract
It is shown that the Bottleneck Assignment problem can be transformed into a special case of the classical Assignment problem. A minor modification of the Hungarian method of the solution for the latter produces an algorithm for the former.

This publication has 0 references indexed in Scilit: