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] |
|---|---|
| 主要作者: | |
| 總結: | 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. Режим доступа: по договору с организацией-держателем ресурса |
| 語言: | 英语 |
| 出版: |
1989
|
| 主題: | |
| 在線閱讀: | https://doi.org/10.1007/BF01070373 |
| 格式: | 電子 Book Chapter |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=666378 |