Geodesic
An algorithm for approximate solution to the Weber problem on a~line with forbidden gaps
Diskretnyj analiz i issledovanie operacij, Tome 23 (2016) no. 1, pp. 82-96

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

The location problem of interconnected facilities on a line with forbidden gaps is considered. The properties of the problem which allow the initial continuous problem to be reduced to the discrete problem are found. The approximate algorithm for solving the problem is developed and the results of computational experiments are presented. Tab. 1, bibliogr. 15.
Keywords: location problem, interconnected facilities, approximate decision. 
@article{DA_2016_23_1_a5,
     author = {G. G. Zabudsky and N. S. Veremchuk},
     title = {An algorithm for approximate solution to the {Weber} problem on a~line with forbidden gaps},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {82--96},
     publisher = {mathdoc},
     volume = {23},
     number = {1},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2016_23_1_a5/}
}
TY  - JOUR
AU  - G. G. Zabudsky
AU  - N. S. Veremchuk
TI  - An algorithm for approximate solution to the Weber problem on a~line with forbidden gaps
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2016
SP  - 82
EP  - 96
VL  - 23
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2016_23_1_a5/
LA  - ru
ID  - DA_2016_23_1_a5
ER  - 
%0 Journal Article
%A G. G. Zabudsky
%A N. S. Veremchuk
%T An algorithm for approximate solution to the Weber problem on a~line with forbidden gaps
%J Diskretnyj analiz i issledovanie operacij
%D 2016
%P 82-96
%V 23
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2016_23_1_a5/
%G ru
%F DA_2016_23_1_a5
G. G. Zabudsky; N. S. Veremchuk. An algorithm for approximate solution to the Weber problem on a~line with forbidden gaps. Diskretnyj analiz i issledovanie operacij, Tome 23 (2016) no. 1, pp. 82-96. http://geodesic.mathdoc.fr/item/DA_2016_23_1_a5/