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
An adaptation of SH heuristic to the location set covering problem
✍ Scribed by Marcos Almiñana; Jesús T. Pastor
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 555 KB
- Volume
- 100
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
✦ Synopsis
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 than the pair CMA/FMC. Its power is experimentally tested over a set of 65 randomly generated problems.
📜 SIMILAR VOLUMES
This paper describes an adaptive hp-version mesh reÿnement strategy and its application to the ÿnite element solution of one-dimensional ame propagation problems. The aim is to control the spatial and time discretization errors below a prescribed error tolerance at all time levels. In the algorithm,