Two methods of ordering the covering elements for the solution of the set covering problem
| Parent link: | Cybernetics Vol. 25, iss. 4.— 1989.— [P. 505-511] |
|---|---|
| Auteur principal: | |
| Résumé: | Title screen Two set-covering algorithms are proposed and proved, one selecting and ordering the covering candidates by degrees and the other using lexicographic ordering. Режим доступа: по договору с организацией-держателем ресурса |
| Langue: | anglais |
| Publié: |
1989
|
| Sujets: | |
| Accès en ligne: | https://doi.org/10.1007/BF01070373 |
| Format: | Électronique Chapitre de livre |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=666378 |
| Résumé: | Title screen Two set-covering algorithms are proposed and proved, one selecting and ordering the covering candidates by degrees and the other using lexicographic ordering. Режим доступа: по договору с организацией-держателем ресурса |
|---|---|
| DOI: | 10.1007/BF01070373 |