Complexity of the min-max and min-max regret assignment problems

Authors:
Hassene Aissi;Cristina Bazgan;Daniel Vanderpooten
Affiliations:
LAMSADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France;LAMSADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France;LAMSADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France
Venue:
Operations Research Letters
Year:
2005

Citing 7
Cited 9

On the robust shortest path problem

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Complexity of robust single facility location problems on networks with uncertain edge lengths

Discrete Applied Mathematics
Interval data minmax regret network optimization problems

Discrete Applied Mathematics
On the complexity of the robust spanning tree problem with interval data

Operations Research Letters
Minmax regret linear resource allocation problems

Operations Research Letters
The robust spanning tree problem with interval data

Operations Research Letters

On the approximability of minmax (regret) network optimization problems

Information Processing Letters
Exact and heuristic algorithms for the interval data robust assignment problem

Computers and Operations Research
Minimizing the number of late jobs on a single machine under due date uncertainty

Journal of Scheduling
Possibilistic bottleneck combinatorial optimization problems with ill-known weights

International Journal of Approximate Reasoning
Complexity of the min-max (regret) versions of cut problems

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the robust assignment problem under a fixed number of cost scenarios

Operations Research Letters
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data

Operations Research Letters
Minmax regret bottleneck problems with solution-induced interval uncertainty structure

Discrete Optimization
Complexity of the min-max (regret) versions of min cut problems

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

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.