Improving the location of minimax facilities through network modification
暂无分享,去创建一个
Consider a network on which one or more facilities are already located. We examine how the network can be modified most efficiently in order to improve the location of the facility when the measure of facility performance is the minimax objective. The types of possible network modifications fall into two categories: reductions in the length of existing arcs or additions of some new arcs that are not currently in the network. A set of reduction and addition problems is introduced for which exact or heuristic algorithms are presented. The principal objective of the paper is in defining and formulating the problems and not in testing the efficacy of the proposed solution methodologies. %: 1994 by John Wiley & Sons, Inc.
[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[2] Pitu B. Mirchandani,et al. Location on networks : theory and algorithms , 1979 .
[3] Oded Berman,et al. Improving the location of minisum facilities through network modification , 1993, Ann. Oper. Res..
[4] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .