The Probabilistic Set-Covering Problem

Authors:
Patrizia Beraldi;Andrzej Ruszczynski
Affiliations:
-;-
Venue:
Operations Research
Year:
2002

Citing 0
Cited 9

Fleet Management for Vehicle Sharing Operations

Transportation Science
Survey: Covering problems in facility location: A review

Computers and Industrial Engineering
An integer programming and decomposition approach to general chance-constrained mathematical programs

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Capital rationing problems under uncertainty and risk

Computational Optimization and Applications
Easy distributions for combinatorial optimization problems with probabilistic constraints

Operations Research Letters
Stochastic 0-1 linear programming under limited distributional information

Operations Research Letters
The Express heuristic for probabilistically constrained integer problems

Journal of Heuristics
Improved integer programming approaches for chance-constrained stochastic programming

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Integrating domain heterogeneous data sources using decomposition aggregation queries

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a probabilistic set-covering problem the right-hand side is a random binary vector and the covering constraint has to be satisfied with some prescribed probability. We analyze the structure of the set of probabilistically efficient points of binary random vectors, develop methods for their enumeration, and propose specialized branch-and-bound algorithms for probabilistic set-covering problems.