| Article ID: | iaor20062295 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 2 |
| Start Page Number: | 175 |
| End Page Number: | 179 |
| Publication Date: | Mar 2006 |
| Journal: | Operations Research Letters |
| Authors: | Woeginger Gerhard J., Deineko Vladimir |
| Keywords: | programming: assignment |
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.