Journal
INFORMS JOURNAL ON COMPUTING
Volume 12, Issue 2, Pages 104-110Publisher
INFORMS
DOI: 10.1287/ijoc.12.2.104.11897
Keywords
multifacility location; complexity; NC-algorithm
Ask authors/readers for more resources
We consider the I-median problem on a network with uncertain weights of nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find the minimax regret location, 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 present the first polynomial algorithm for this problem on a general network. For the problem on a tree network, we discuss an algorithm with an order of complexity improved over the algorithms known in the literature.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available