Two methods of ordering the covering elements for the solution of the set covering problem; Cybernetics; Vol. 25, iss. 4

Xehetasun bibliografikoak
Parent link:Cybernetics
Vol. 25, iss. 4.— 1989.— [P. 505-511]
Egile nagusia: Muravyov (Murav’ev) S. V. Sergey Vasilyevich
Gaia: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.
Режим доступа: по договору с организацией-держателем ресурса
Hizkuntza:ingelesa
Argitaratua: 1989
Gaiak:
Sarrera elektronikoa:https://doi.org/10.1007/BF01070373
Formatua: Baliabide elektronikoa Liburu kapitulua
KOHA link:https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=666378

Antzeko izenburuak