A fast algorithm for locating supplying center on a lattice

References

• Knuth , D.E. 1981 . The Art of Computer Programming , Addison-Wesley .
   Google Scholar
• Lovasz , L. 1986 . An Algorithmic Theory of Numbers, Graphs and Complexity , Pennsylvania : Society for Industrial and Applied Mathematics .
   Google Scholar
• Melzak , Z.A. 1973 . A Companion to Concrete Mathematics , New York : Wiley Interscience .
   Google Scholar
• Megiddo , N. and Supowit , K.J . 1984 . On the complexity of some common geometric location problems . SIAM J. COMPUT , 13 : 182 – 196 .
   Web of Science ®Google Scholar
• Metha , S. , Mukherjee , M. and Nagy , G. . Constrained integer approximation to 2-D line intersections . Second Canadian Conf . Ottawa, Canada. pp. 302 – 305 . Computational Geometry .
   Google Scholar
• Papadimitriou , C.H. and Steiglitz , K. 1982 . Combinatorial Optimization: Algorithms and Complexity , New Jersey : Prentice-Hall .
   Google Scholar
• Preparata , F.P. and Shamos , M.I. 1995 . Computational Geometry: An Introduction , New York : Springer-Verlag .
   Google Scholar
• Weber A. Uber den Standort der Industries Erster Teil: Reine Theorie dis Standorts Mit einem mathematischen Anhang von Georg Pick (Mohr, J. C. B. (Paul Siebeck) Tubingen 1909
   Google Scholar