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

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 197; no. 2; pp. 427 - 438
Main Authors:	Aissi, Hassene, Bazgan, Cristina, Vanderpooten, Daniel
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.09.2009 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!