Cutset Inequalities for Robust Network Design

Robust optimization is an emerging approach in integer programming taking data uncertainty into account. Recently, the adjustable Γ-robustness approach of Bertsimas and Sim [3, 4] has been applied to network design problems. In this paper, we consider this so-called Γ-robust network design problem....

Full description

Saved in:
Bibliographic Details
Published inNetwork Optimization pp. 118 - 123
Main Authors Koster, Arie M. C. A., Kutschka, Manuel, Raack, Christian
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2011
SeriesLecture Notes in Computer Science
Online AccessGet full text

Cover

More Information
Summary:Robust optimization is an emerging approach in integer programming taking data uncertainty into account. Recently, the adjustable Γ-robustness approach of Bertsimas and Sim [3, 4] has been applied to network design problems. In this paper, we consider this so-called Γ-robust network design problem. We investigate its polyhedral structure and present robust versions of the cutset inequalities as well as computational results on their effectiveness.
ISBN:3642215262
9783642215261
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-21527-8_15