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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operations research Ročník 50; číslo 6; s. 956 - 967
Hlavní autoři: Beraldi, Patrizia, Ruszczynski, Andrzej
Médium: Journal Article
Jazyk:angličtina
Vydáno: Linthicum INFORMS 01.11.2002
Institute for Operations Research and the Management Sciences
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.50.6.956.345