Recoverable robustness by column generation

Authors:
P. C. Bouman;J. M. Van Den Akker;J. A. Hoogeveen
Affiliations:
Department of Information and Computing Sciences, Utrecht University, The Netherlands;Department of Information and Computing Sciences, Utrecht University, The Netherlands;Department of Information and Computing Sciences, Utrecht University, The Netherlands
Venue:
ESA'11 Proceedings of the 19th European conference on Algorithms
Year:
2011

Citing 4
Cited 1

Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
The Price of Robustness

Operations Research
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Recoverable Robustness in Shunting and Timetabling

Robust and Online Large-Scale Optimization

Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Real-life planning problems are often complicated by the occurrence of disturbances, which imply that the original plan cannot be followed anymore and some recovery action must be taken to cope with the disturbance. In such a situation it is worthwhile to arm yourself against common disturbances. Well-known approaches to create plans that take possible, common disturbances into account are robust optimization and stochastic programming. Recently, a new approach has been developed that combines the best of these two: recoverable robustness. In this paper, we apply the technique of column generation to find solutions to recoverable robustness problems. We consider two types of solution approaches: separate recovery and combined recovery. We show our approach on two example problems: the size robust knapsack problem, in which the knapsack size may get reduced, and the demand robust shortest path problem, in which the sink is uncertain and the cost of edges may increase.