Classical Center Location Problem Under Uncertain Environment

Abstract

<em>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.‎ </em>