Geodesic
Exact algorithm for solving special case of discrete Weber problem
Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 136-137

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

An algorithm reasonably solving Weber problem for $n$-sequentially connected chain and finite set of points of location is described. The algorithm is compared with an integer linear programming algorithm realized in IBM ILOG CPLEX.
Keywords: Weber problem, n-sequentially connected chain, dynamic programming, exact algorithm
Mots-clés : quasi-polynomial algorithm. 
@article{PDMA_2013_6_a59,
     author = {R. E. Shangin},
     title = {Exact algorithm for solving special case of discrete {Weber} problem},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {136--137},
     publisher = {mathdoc},
     number = {6},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a59/}
}
TY  - JOUR
AU  - R. E. Shangin
TI  - Exact algorithm for solving special case of discrete Weber problem
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2013
SP  - 136
EP  - 137
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2013_6_a59/
LA  - ru
ID  - PDMA_2013_6_a59
ER  - 
%0 Journal Article
%A R. E. Shangin
%T Exact algorithm for solving special case of discrete Weber problem
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2013
%P 136-137
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2013_6_a59/
%G ru
%F PDMA_2013_6_a59
R. E. Shangin. Exact algorithm for solving special case of discrete Weber problem. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 136-137. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a59/