TY - JOUR
ID - 11916
TI - Classical Center Location Problem Under Uncertain Environment
JO - International Journal of Industrial Mathematics
JA - IJIM
LA - en
SN - 2008-5621
AU - Soltanpour, A.
AU - Baroughi, F.
AU - Alizadeh, B.
AD - Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran.
AD - Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran.
Y1 - 2017
PY - 2017
VL - 9
IS - 4
SP - 365
EP - 374
KW - Location Problem
KW - $p$-center
KW - uncertainty theory
KW - Uncertain Programming
DO -
N2 - This paper investigates the $p$-center location problem on a network in which vertex weights and distances between vertices are uncertain. The concepts of the $\alpha$-$p$-center and the expected $p$-center are introduced. It is shown that the $\alpha$-$p$-center and the expected $p$-center models can be transformed into corresponding deterministic models. Finally, linear time algorithms for finding the 1-center and \\2-center of uncertain unweighted trees are proposed.
UR - https://ijim.srbiau.ac.ir/article_11916.html
L1 - https://ijim.srbiau.ac.ir/article_11916_b68eeb0311af294f42892c455f46b7e3.pdf
ER -