Min-max-min robust combinatorial optimization

  title={Min-max-min robust combinatorial optimization},
  author={Christoph Buchheim and Jannis Kurtz},
  journal={Math. Program.},
The idea of k-adaptability in two-stage robust optimization is to calculate a fixed number k of second-stage policies here-and-now. After the actual scenario is revealed, the best of these policies is selected. This idea leads to a min-max-min problem. In this paper, we consider the case where no first stage variables exist and propose to use this approach to solve combinatorial optimization problems with uncertainty in the objective function. We investigate the complexity of this special case… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS


Publications referenced by this paper.
Showing 1-10 of 22 references

Robust Discrete Optimization and Its Applications

P. Kouvelis, G. Yu
Springer • 1996
View 6 Excerpts
Highly Influenced

Geometric Algorithms and Combinatorial Optimization

M. Grötschel, L. Lovász, A. Schrijver
Springer • 1993
View 6 Excerpts
Highly Influenced

Finite Adaptability in Multistage Linear Optimization

IEEE Transactions on Automatic Control • 2010
View 1 Excerpt

Multicriteria Global Minimum Cuts

Algorithmica • 2006
View 1 Excerpt

Similar Papers

Loading similar papers…