The probabilistic set-covering problem

被引：70

作者：

Beraldi, P ^{[1
]}

Ruszczynski, A

机构：

[1] Univ Calabria, Dipartimento Elettron Informat & Sistemist, I-87036 Arcavacata Di Rende, CS, Italy

[2] Rutgers State Univ, Dept Management Sci & Informat Syst, Piscataway, NJ 08854 USA

来源：

OPERATIONS RESEARCH | 2002年 / 50卷 / 06期

关键词：

D O I：

10.1287/opre.50.6.956.345

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：956 / 967

页数：12

共 31 条

[1] A dynamic subgradient-based branch-and-bound procedure for set covering [J].