The minmax regret gradual covering location problem on a network with incomplete information of demand weights

The gradual covering location problem seeks to establish facilities on a network so as to maximize the total demand covered allowing partial coverage We focus on the gradual covering location problem when the demand weights associated with nodes of the network are random variables whose probability distributions are unknown Using only information on the range of these random variables this study is aimed at finding the minmax regret location that minimizes the worst case coverage loss We show that under some conditions the problem is equivalent to known location problems (e g the minmax regret median problem) Polynomial time algorithms are developed for the problem on a general network with linear coverage decay functions (C) 2010 Elsevier B V All rights reserved