CLASSICAL CENTER LOCATION PROBLEM UNDER UNCERTAIN ENVIRONMENT

In this paper, we investigate the classical discrete p-center location problem on a network in which the vertex weights and the distances between vertices are uncertain variables. The aim is to locate p facilities on vertices of the network such that the maximum of the weighted distances from each vertex to its closest facility becomes minimum. We show that the uncertain p-center problem is Np-hard on general networks. Then we present a method for solving the uncertain 1-center problem on unweighted tree networks.