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

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, spannin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 197; H. 2; S. 427 - 438
Hauptverfasser: Aissi, Hassene, Bazgan, Cristina, Vanderpooten, Daniel
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.09.2009
Elsevier
Elsevier Sequoia S.A
Schriftenreihe:European Journal of Operational Research
Schlagworte:
Applied sciences
Approximation
Assignment problem
Combinatorial optimization
Complexity
Exact sciences and technology
Flows in networks. Combinatorial problems
Knapsack problem
Min-max Min-max regret Combinatorial optimization Complexity Approximation Robustness
Min–max
Min–max regret
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Robustness
Shortest path algorithms
Studies
Robustness
Min–max
Min–max regret
Approximation
Combinatorial optimization
Complexity
Spanning tree
Minimax method
NP hard problem
Shortest path
Min-max
Knapsack problem
Min-max regret
ISSN:0377-2217, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2008.09.012