A new assignment rule to improve seed points algorithms for the continuous k-center problem
暂无分享,去创建一个
[1] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[2] G. Y. Handler,et al. Relaxation method for the solution of the minimax location-allocation problem in Euclidean space , 1987 .
[3] Z. Drezner. On the rectangular p‐center problem , 1987 .
[4] Blas Pelegrín,et al. On the uniqueness of optimal solutions in continuous location theory , 1985 .
[5] A. Frieze,et al. A simple heuristic for the p-centre problem , 1985 .
[6] David B. Shmoys,et al. A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..
[8] D. Hearn,et al. The Minimum Covering Sphere Problem , 1972 .
[9] R. Chandrasekaran,et al. A note on the m-center problem with rectilinear distances , 1988 .
[10] James Vijay,et al. An Algorithm for the p-Center Problem in the Plane , 1985, Transp. Sci..
[11] Nimrod Megiddo,et al. On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..
[12] Zvi Drezner,et al. The p-Centre Problem—Heuristic and Optimal Algorithms , 1984 .
[13] Ján Plesník,et al. A heuristic for the p-center problems in graphs , 1987, Discret. Appl. Math..
[14] Horst A. Eiselt,et al. A Note on p-Center Problems in the Plane , 1986, Transp. Sci..
[15] Richard C. T. Lee,et al. Rectilinear m‐Center problem , 1990 .
[16] Blas Pelegrín. Heuristic methods for the p-center problem , 1991 .