The probabilistic set-covering problem
成果类型：
Article
署名作者：
Beraldi, P; Ruszczynski, A
署名单位：
University of Calabria; Rutgers University System; Rutgers University New Brunswick
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.50.6.956.345
发表日期：
2002
页码：
956-967
关键词：
摘要：
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.