On locating new facilities in a competitive environment
暂无分享,去创建一个
[1] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .
[2] S. Hakimi. Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .
[3] A. J. Goldman. Optimal Locations for Centers in a Network , 1969 .
[4] A. J. Goldman. Optimal Center Location in Simple Networks , 1971 .
[5] S. L. Hakimi,et al. Optimum Locations of Centers in Networks , 1972, Oper. Res..
[6] R. E. Wendell,et al. Optimal Locations on a Network , 1973 .
[7] A. M. Geoffrion,et al. Multicommodity Distribution System Design by Benders Decomposition , 1974 .
[8] Peter J. Slater,et al. Maximin facility location , 1975 .
[9] Timothy J. Lowe,et al. Convex Location Problems on Tree Networks , 1976, Oper. Res..
[10] Jonathan Halpern,et al. THE LOCATION OF A CENTER-MEDIAN CONVEX COMBINATION ON AN UNDIRECTED TREE* , 1976 .
[11] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[12] T. Lowe. Efficient Solutions in Multiobjective Tree Network Location Problems , 1978 .
[13] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[14] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[15] Oded Berman,et al. Developments in network location with mobile and congested facilities , 1981 .
[16] R. L. Francis,et al. Finding efficient solutions for rectilinear distance location problems efficiently , 1981 .
[17] Nimrod Megiddo,et al. An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems , 1981, SIAM J. Comput..
[18] R. E. Wendell,et al. New perspectives in competitive location theory , 1981 .
[19] Jakob Krarup,et al. Reducibility of minimax to minisum 0-1 programming problems , 1981 .
[20] Donald Erlenkotter,et al. A comparative study of approaches to dynamic location problems , 1981 .