期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 123, 期 2, 页码 292-302出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(99)00257-X
关键词
location; facilities; complexity
We consider the weighted 1-center problem on a network with uncertainty in node weights and edge lengths. Uncertainty is modelled by means of interval estimates for parameters. Specifically, each uncertain parameter is assumed to be random with unknown distribution and tan take on any value within a corresponding prespecified interval. It is required to find a robust (minmax regret) solution, that is, a location which is epsilon-optimal for any possible realization of parameters, with epsilon as Small as possible. The problem on a general network is known to be NP-hard; for the problem on a tree, we present a polynomial algorithm. (C) 2000 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据