The Probabilistic Set-Covering Problem

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 enumer...

Full description

Saved in:

Bibliographic Details
Published in:	Operations research Vol. 50; no. 6; pp. 956 - 967
Main Authors:	Beraldi, Patrizia, Ruszczynski, Andrzej
Format:	Journal Article
Language:	English
Published:	Linthicum INFORMS 01.11.2002 Institute for Operations Research and the Management Sciences
Subjects:	Algorithms Children Determinism Fuzzy sets Heuristic Heuristics Integer programming Integers Mathematical models Mathematical vectors Methods Operations research Optimal solutions Performance evaluation Probability Probability distributions Programming: integer Programming: stochastic Prunes Random variables Set theory Studies
ISSN:	0030-364X, 1526-5463
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!