| Article ID: | iaor20032102 |
| Country: | United States |
| Volume: | 50 |
| Issue: | 6 |
| Start Page Number: | 956 |
| End Page Number: | 967 |
| Publication Date: | Nov 2002 |
| Journal: | Operations Research |
| Authors: | Ruszczyski Andrzej, Beraldi Patrizia |
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.