Recoverable robust knapsacks: Γ-scenarios

Authors:
Christina Büsing;Arie M. C. A. Koster;Manuel Kutschka
Affiliations:
Technische Universität Berlin, Institut für Mathematik, Berlin, Germany;RWTH Aachen University, Lehrstuhl II für Mathematik, Aachen, Germany;RWTH Aachen University, Lehrstuhl II für Mathematik, Aachen, Germany
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 2
Cited 1

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
The Price of Robustness

Operations Research

Exact solution of the robust knapsack problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate the recoverable robust knapsack problem, where the uncertainty of the item weights follows the approach of Bertsimas and Sim [3,4]. In contrast to the robust approach, a limited recovery action is allowed, i.e., up to k items may be removed when the actual weights are known. This problem is motivated by the assignment of traffic nodes to antennas in wireless network planning. Starting from an exponential min-max optimization model, we derive an integer linear programming formulation of quadratic size. In a preliminary computational study, we evaluate the gain of recovery using realistic planning data.