Geodesic
The set covering problem: complexity, algorithms, and experimental investigations
Diskretnyj analiz i issledovanie operacij, Tome 7 (2000) no. 2, pp. 22-46.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2000_7_2_a3,
     author = {A. V. Eremeev and L. A. Zaozerskaya and A. A. Kolokolov},
     title = {The set covering problem: complexity, algorithms, and experimental investigations},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {22--46},
     publisher = {mathdoc},
     volume = {7},
     number = {2},
     year = {2000},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2000_7_2_a3/}
}
TY  - JOUR
AU  - A. V. Eremeev
AU  - L. A. Zaozerskaya
AU  - A. A. Kolokolov
TI  - The set covering problem: complexity, algorithms, and experimental investigations
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2000
SP  - 22
EP  - 46
VL  - 7
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2000_7_2_a3/
LA  - ru
ID  - DA_2000_7_2_a3
ER  - 
%0 Journal Article
%A A. V. Eremeev
%A L. A. Zaozerskaya
%A A. A. Kolokolov
%T The set covering problem: complexity, algorithms, and experimental investigations
%J Diskretnyj analiz i issledovanie operacij
%D 2000
%P 22-46
%V 7
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2000_7_2_a3/
%G ru
%F DA_2000_7_2_a3
A. V. Eremeev; L. A. Zaozerskaya; A. A. Kolokolov. The set covering problem: complexity, algorithms, and experimental investigations. Diskretnyj analiz i issledovanie operacij, Tome 7 (2000) no. 2, pp. 22-46. http://geodesic.mathdoc.fr/item/DA_2000_7_2_a3/