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

被引：63

作者：

Aissi, H ^{[1
]}

Bazgan, C ^{[1
]}

Vanderpooten, D ^{[1
]}

机构：

[1] Univ Paris 09, LAMSADE, F-75775 Paris, France

来源：

OPERATIONS RESEARCH LETTERS | 2005年 / 33卷 / 06期

关键词：

assignment problem; min-max; min-max regret; complexity; NP-hard;

D O I：

10.1016/j.orl.2004.12.002

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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. (c) 2005 Elsevier B.V. All rights reserved.

引用

下载

页码：634 / 640

页数：7

共 50 条

[1] Complexity of the min-max (regret) versions of min cut problems
Aissi, Hassene
Bazgan, Cristina
Vanderpooten, Daniel
DISCRETE OPTIMIZATION, 2008, 5 (01) : 66 - 73
[2] Min-max and min-max regret versions of combinatorial optimization problems: A survey
Aissi, Hassene
Bazgan, Cristina
Vanderpooten, Daniel
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) : 427 - 438
[3] Pseudo-polynomial algorithms for min-max and min-max regret problems
Aissi, Hassene
Bazgan, Cristina
Vanderpooten, Daniel
Operations Research and Its Applications, 2005, 5 : 171 - 178
[4] Complexity of the min-max (regret) versions of cut problems
Aissi, H
Bazgan, C
Vanderpooten, D
ALGORITHMS AND COMPUTATION, 2005, 3827 : 789 - 798
[5] Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems
Aissi H.
4OR, 2006, 4 (4) : 347 - 350
[6] Approximation of min-max and min-max regret versions of some combinatorial optimization problems
Aissi, Hassene
Bazgan, Cristina
Vanderpooten, Daniel
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (02) : 281 - 290
[7] Min-Max Spaces and Complexity Reduction in Min-Max Expansions
Gaubert, Stephane
McEneaney, William M.
APPLIED MATHEMATICS AND OPTIMIZATION, 2012, 65 (03): : 315 - 348
[8] Min-Max Spaces and Complexity Reduction in Min-Max Expansions
Stephane Gaubert
William M. McEneaney
Applied Mathematics & Optimization, 2012, 65 : 315 - 348
[9] Min-max and min-max (relative) regret approaches to representatives selection problem
Dolgui, Alexandre
Kovalev, Sergey
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (02): : 181 - 192
[10] Robust min-max regret covering problems
Coco, Amadeu A.
Santos, Andrea Cynthia
Noronha, Thiago F.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 83 (01) : 111 - 141

← 1 2 3 4 5 →