On the robust assignment problem under a fixed number of cost scenarios

Authors:
Vladimir G. DeıNeko;Gerhard J. Woeginger
Affiliations:
Warwick Business School, The University of Warwick, Coventry CV4 7AL, UK;Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Operations Research Letters
Year:
2006

Citing 5
Cited 1

Matching is as easy as matrix inversion

Combinatorica
Exact arborescences, matchings and cycles

Discrete Applied Mathematics
Optimizing over a slice of the bipartite matching polytope

Discrete Mathematics - Proceedings of the Oberwolfach Meeting "Kombinatorik," January 19-25, 1986
The complexity of restricted spanning tree problems

Journal of the ACM (JACM)
Complexity of the min-max and min-max regret assignment problems

Operations Research Letters

Minimizing the number of late jobs on a single machine under due date uncertainty

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

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.