The Probabilistic Set-Covering Problem
- 1 December 2002
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 50 (6) , 956-967
Abstract
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.Keywords
This publication has 21 references indexed in Scilit:
- Algorithms for the Set Covering ProblemAnnals of Operations Research, 2000
- A Heuristic Method for the Set Covering ProblemOperations Research, 1999
- A Lagrangian-based heuristic for large-scale set covering problemsMathematical Programming, 1998
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set CoveringOperations Research, 1996
- A genetic algorithm for the set covering problemEuropean Journal of Operational Research, 1996
- Gröbner Bases1993
- Enhancing an algorithm for set covering problemsEuropean Journal of Operational Research, 1992
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- A lagrangian heuristic for set-covering problemsNaval Research Logistics (NRL), 1990
- An algorithm for set covering problemEuropean Journal of Operational Research, 1987