The facility locations problem for minimizing CDMA hard handoffs
暂无分享,去创建一个
[1] M. Rao,et al. An Algorithm for the M-Median Plant Location Problem , 1974 .
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Donald Erlenkotter,et al. A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..
[4] Ehl Emile Aarts,et al. Simulated annealing : an introduction , 1989 .
[5] Roberto D. Galvão,et al. A Dual-Bounded Algorithm for the p-Median Problem , 1980, Oper. Res..
[6] F. E. Maranzana,et al. On the Location of Supply Points to Minimize Transport Costs , 1964 .
[7] Kurt Spielberg,et al. Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..
[8] Polly Bart,et al. Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..
[9] Bezalel Gavish,et al. Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.
[10] I. G. Tollis. Optimal partitioning of cellular networks , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.
[11] T. L. Ray,et al. A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..