𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probabilistic partial set covering problems

✍ Scribed by Hanif D. Sherali; Seong-In Kim; Edna L. Parrish

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
563 KB
Volume
38
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An efficient heuristic for large set cov
An efficient heuristic for large set covering problems
✍ Francis J. Vasko πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 477 KB

## Abstract A heuristic solution procedure for set covering is presented that works well for large, relatively dense problems. In addition, a confidence interval is established about the unknown global optimum. Results are presented for 30 large randomly generated problems.

The multi-integer set cover and the faci
The multi-integer set cover and the facility terminal cover problem
✍ Dorit S. Hochbaum; Asaf Levin πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 86 KB

## Abstract The facility terminal cover problem is a generalization of the vertex cover problem. The problem is to β€œcover” the edges of an undirected graph __G__ = (__V__,__E__) where each edge __e__ is associated with a non‐negative demand __d__~__e__~. An edge __e__ = __u__,__v__ is covered if at

A generalization of the weighted set cov
A generalization of the weighted set covering problem
✍ Jian Yang; Joseph Y-T. Leung πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 122 KB

## Abstract We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect __b__‐matching problem. In general,