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 |
स्वरूप: | इलेक्ट्रोनिक पुस्तक अध्याय |
KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=666378 |