期刊
INFORMS JOURNAL ON COMPUTING
卷 12, 期 2, 页码 104-110出版社
INFORMS
DOI: 10.1287/ijoc.12.2.104.11897
关键词
multifacility location; complexity; NC-algorithm
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据