Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481493 | European Journal of Operational Research | 2009 | 12 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten,