Article ID Journal Published Year Pages File Type
10523998 Operations Research Letters 2005 7 Pages PDF
Abstract
This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment problem is strongly NP-hard.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Complexity of the min-max and min-max regret assignment problems
Authors
, , ,