Locating an Obnoxious Facility on a Network
暂无分享,去创建一个
We deal with the problem of locating a point on a network so as to maximize the sum of its weighted distances to the nodes. It is shown that there is at least one optimal point in a finite set of points which can easily be generated. An algorithm is given for locating an optimal point in this set. When the network is a tree, this set consists of the “dangling” nodes.
[1] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .
[2] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[3] A. J. Goldman. Optimal Center Location in Simple Networks , 1971 .