Geodesic
Exact algorithm for solving discrete Weber problem for a~cycle
Prikladnaâ diskretnaâ matematika, no. 4 (2013), pp. 96-102

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

A polynomial algorithm solving discrete Weber problem for cycle and for finite set of location positions is presented. The algorithm is based on the dynamic programming idea. The comparison of action times of the given algorithm and of an integer linear programming model, which was realized in IBM ILOG CPLEX, is carried out.
Keywords: Weber problem, cycle, dynamic programming, exact algorithm. 
@article{PDM_2013_4_a9,
     author = {R. E. Shangin},
     title = {Exact algorithm for solving discrete {Weber} problem for a~cycle},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {96--102},
     publisher = {mathdoc},
     number = {4},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2013_4_a9/}
}
TY  - JOUR
AU  - R. E. Shangin
TI  - Exact algorithm for solving discrete Weber problem for a~cycle
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2013
SP  - 96
EP  - 102
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2013_4_a9/
LA  - ru
ID  - PDM_2013_4_a9
ER  - 
%0 Journal Article
%A R. E. Shangin
%T Exact algorithm for solving discrete Weber problem for a~cycle
%J Prikladnaâ diskretnaâ matematika
%D 2013
%P 96-102
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2013_4_a9/
%G ru
%F PDM_2013_4_a9
R. E. Shangin. Exact algorithm for solving discrete Weber problem for a~cycle. Prikladnaâ diskretnaâ matematika, no. 4 (2013), pp. 96-102. http://geodesic.mathdoc.fr/item/PDM_2013_4_a9/