𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two methods of ordering the covering elements for the solution of the set covering problem

✍ Scribed by S. V. Murav'ev

Publisher
Springer US
Year
1990
Tongue
English
Weight
491 KB
Volume
25
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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,

An adaptation of SH heuristic to the loc
An adaptation of SH heuristic to the location set covering problem
✍ Marcos AlmiΓ±ana; JesΓΊs T. Pastor πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 555 KB

In a recent paper, a new surrogate heuristic (SH) has been proposed for the set covering problem. Here we present an adaptation of it in order to solve more efficiently the location set covering problem. We will show that our new version not only outperforms algorithm SH but that it is more accurate

HLA serum screening based on an heuristi
HLA serum screening based on an heuristic solution of the set cover problem
✍ M.A Woodbury; E.A Ciftan; D.B Amos πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science βš– 496 KB

A computer program initially written by the Milwaukee Blood Bank has been modified to use a new algorithm for the assignment of HLA specificities to antisera. The assignment is based on the reactions of cells with known specificities. Specificities which are present only on cells which do not react