We consider the weighted p-center problem on a transportation network with uncertain weights of nodes. Specifically, for each node, an interval estimate of its weight is known. The objective is to find the ‘minimax regret’ solution, i.e. to minimize the worst-case loss in the objective function that may occur because a decision is made without knowing which state of nature will take place. We discuss properties of the problem and show that the problem can be solved by means of solving (n+1) regular weighted p-center problems. This leads to polynomial algorithms for the cases where the regular weighted p-center problem can be solved in polynomial time, e.g. for the case of a tree network, and for the case of a general network with p = 1.
