Abstract

We investigate the complexity of the min-max assignment problem under a fixed number of scenarios. We prove that this problem is polynomial-time equivalent to the exact perfect matching problem in bipartite graphs. an infamous combinatorial optimization problem of unknown computational complexity. (c) 2005 Published by Elsevier B.V.