Optimization Online


A Robust Formulation of the Uncertain Set Covering Problem

Dirk Degel (dirk.degel***at***rub.de)
Pascal Lutter (pascal.lutter***at***rub.de)

Abstract: This work introduces a robust formulation of the uncertain set covering problem combining the concepts of robust and probabilistic optimization. It is shown that the proposed robust uncertain set covering problem can be stated as a compact mixed-integer linear programming model which can be solved with modern computer software. This model is a natural extension of the classical set covering problem in order to cope with uncertainty in covering constraints.

Keywords: Set covering problem, Robust optimization, Robust uncertain set covering problem

Category 1: Robust Optimization

Category 2: Applications -- OR and Management Sciences


Download: [PDF]

Entry Submitted: 06/17/2013
Entry Accepted: 06/17/2013
Entry Last Modified: 06/17/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society