I have a modified Assignment Problem, that can almost be solved using the Hungarian Algorithm.
Instead of trying to minimize the sum of costs of assignments, I want to minimize the cost of the costliest assignment. Using the explanation of Hungarian algorithm at wikipedia , one could say that I want to find a solution that minimizes the amount paid to the highest salaried worker.
One suggestion I've received is to simply use a modified cost matrix, with every value in the cost matrix raised to a biggish exponent (say, 10), and then use the standard Hungarian Algorithm.
But perhaps there is a better way?