Pseudo-polynomial algorithms for min-max and min-max regret problems

被引：0

作者：

Aissi, Hassene ^{[1
]}

Bazgan, Cristina ^{[1
]}

Vanderpooten, Daniel ^{[1
]}

机构：

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

来源：

Operations Research and Its Applications | 2005年 / 5卷

关键词：

min-max; min-max regret; computational complexity; pseudo-polynomial;

D O I：

暂无

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We present in this paper general pseudo-polynomial time algorithms to solve min-max and min-max regret versions of some polynomial or pseudo-polynomial problems under a constant number of scenarios. Using easily computable bounds, we can improve these algorithms. This way we provide pseudo-polynomial algorithms for the min-max and and min-max regret versions of several classical problems including minimum spanning tree, shortest path, and knapsack.

引用

页码：171 / 178

页数：8

共 50 条

[1] Complexity of the min-max and min-max regret assignment problems
Aissi, H
Bazgan, C
Vanderpooten, D
[J]. OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 634 - 640
[2] Min-max and min-max regret versions of combinatorial optimization problems: A survey
Aissi, Hassene
Bazgan, Cristina
Vanderpooten, Daniel
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) : 427 - 438
[3] Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems
Aissi H.
[J]. 4OR, 2006, 4 (4) : 347 - 350
[4] Approximation of min-max and min-max regret versions of some combinatorial optimization problems
Aissi, Hassene
Bazgan, Cristina
Vanderpooten, Daniel
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (02) : 281 - 290
[5] Approximating min-max (regret) versions of some polynomial problems
Aissi, Hassene
Bazgan, Cristina
Vanderpooten, Daniel
[J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 428 - 438
[6] Min-max and min-max (relative) regret approaches to representatives selection problem
Dolgui, Alexandre
Kovalev, Sergey
[J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (02): : 181 - 192
[7] Robust min-max regret covering problems
Coco, Amadeu A.
Santos, Andrea Cynthia
Noronha, Thiago F.
[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 83 (01) : 111 - 141
[8] Robust min-max regret covering problems
Amadeu A. Coco
Andréa Cynthia Santos
Thiago F. Noronha
[J]. Computational Optimization and Applications, 2022, 83 : 111 - 141
[9] Complexity of the min-max (regret) versions of min cut problems
Aissi, Hassene
Bazgan, Cristina
Vanderpooten, Daniel
[J]. DISCRETE OPTIMIZATION, 2008, 5 (01) : 66 - 73
[10] General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
Aissi, Hassene
Bazgan, Cristina
Vanderpooten, Daniel
[J]. DISCRETE OPTIMIZATION, 2010, 7 (03) : 136 - 148

← 1 2 3 4 5 →