Min-max and min-max regret versions of combinatorial optimization problems: A survey

被引：337

作者：

Aissi, Hassene ^{[1
]}

Bazgan, Cristina ^{[1
]}

Vanderpooten, Daniel ^{[1
]}

机构：

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

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2009年 / 197卷 / 02期

关键词：

Min-max; Min-max regret; Combinatorial optimization; Complexity; Approximation; Robustness; SPANNING TREE PROBLEM; SHORTEST-PATH PROBLEM; ROBUST OPTIMIZATION; INTERVAL DATA; BOUND ALGORITHM; COMPLEXITY; APPROXIMATION; LOCATION; NETWORK; TIME;

D O I：

10.1016/j.ejor.2008.09.012

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, min cut, min s-t Cut, knapsack. Since most of these problems are NP-hard, we also investigate the approximability of these problems. Furthermore, we present algorithms to solve these problems to optimality. (C) 2008 Elsevier B.V. All rights reserved.

引用

页码：427 / 438

页数：12

共 66 条

[61]

Vincke P., 1999, Journal of Multi-Criteria Decision Analysis, V8, P181

[62] APPROXIMATION OF PARETO OPTIMA IN MULTIPLE-OBJECTIVE, SHORTEST-PATH PROBLEMS [J].