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 heuristic solution of the set cover problem
β Scribed by M.A Woodbury; E.A Ciftan; D.B Amos
- Publisher
- Elsevier Science
- Year
- 1979
- Weight
- 496 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0010-468X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 are first ruled out. This step is followed by one or more steps in which the 'least reactive' specificities are ruled out. The rationale for the algorithm is discussed and an example is presented.
NP-complete
Serum screening FORTRAN Serology Specificities
π SIMILAR VOLUMES
s method Geotechnics Shallow foundations Multi-layered materials
The concentration of inorganic phosphate (Pi) and activity of adenosine deaminase (ADA) in human serum were determined by measuring the anodic current of uric acid with a dialysis membrane-covered carbon electrode in the presence of purine nucleoside phosphorylase (PNP) and xanthine oxidase (XOD) in