Geodesic
The plant location problem on a~two-tree with bounded communication capacities
Diskretnyj analiz i issledovanie operacij, Tome 7 (2000) no. 1, pp. 3-8.

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

@article{DA_2000_7_1_a0,
     author = {I. P. Voznyuk},
     title = {The plant location problem on a~two-tree with bounded communication capacities},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--8},
     publisher = {mathdoc},
     volume = {7},
     number = {1},
     year = {2000},
     language = {ru},
     url = {https://geodesic-test.mathdoc.fr/item/DA_2000_7_1_a0/}
}
TY  - JOUR
AU  - I. P. Voznyuk
TI  - The plant location problem on a~two-tree with bounded communication capacities
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2000
SP  - 3
EP  - 8
VL  - 7
IS  - 1
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/DA_2000_7_1_a0/
LA  - ru
ID  - DA_2000_7_1_a0
ER  - 
%0 Journal Article
%A I. P. Voznyuk
%T The plant location problem on a~two-tree with bounded communication capacities
%J Diskretnyj analiz i issledovanie operacij
%D 2000
%P 3-8
%V 7
%N 1
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/DA_2000_7_1_a0/
%G ru
%F DA_2000_7_1_a0
I. P. Voznyuk. The plant location problem on a~two-tree with bounded communication capacities. Diskretnyj analiz i issledovanie operacij, Tome 7 (2000) no. 1, pp. 3-8. https://geodesic-test.mathdoc.fr/item/DA_2000_7_1_a0/