[1] G. J. Werden. Horizontal mergers: Comments[J], Amer. Econ. Rev,1991,81:1002-1006.
[2] Nimrod Megiddo.Linear-time algorithms for linear programming in R3 and related problems.Franz Aurenhammer.Voronoi diagrams-a survey of a fundamental geometric data structure[J]. ACM Computing Surveys,1991,23:345-406.
[3] Drezner,Z.,The P-center problem-Heuristics and optimal algorithms [J]. Oper.Res.Soc.,1984,35(8):741-745.
[4] R.Z.Hwang,R.C.T.Lee,and R.C.Chang.,The Slab Dividing Approach To Solve the Euclidean P-Center Problem[J].Algorithmica 1993,9:1-22.
[5] Hwang,F.K.,Optimal partitions[J]. Optimization Theory and Applications 1981,34:1-10.
[6] 徐寅峰,刘自成.关于最大权k子集分拆问题[J]. 高效应用数学研究,1994,9(4).
[7] 周培德. 计算几何--算法分析与设计[M].清华大学出版社.
[8] Franz Aurenhammer Voronoi diagrams-a survey of a fundamental geometric data structure[J].Computing Surveys 1991,23:345-406.
[9] S.Voronoi diagrams and Delaunay triangulations[M].In Du D Z(ed).Computing in Euclidean geometry,Word Scientific Publishing Co.Pte.Ltd,1995.
[10] Gold,C.M.Remmele P.R.Roos,T.Fully Dynamic and Kinematic Voronoi Diagrams in GIS[J].Algorithmica 1998.
[11] Kenny Wong An Efficient Implementation of Fortune's Plane-Sweep Algorithm for Voronoi Diagrams[Z]. http://www.cs.ualberta.ca/～kenw/publications.html.
[12] F.Aurenhammer and R.Klein.Voronoi diagrams[M].In J.Sack and G.Urrutia,editors. Handbook of Computational Geometry,pages 201-290,Elsevier Science Publishing,2000.
[13] 谢金星,邢文训.网络优化[M].清华大学出版社,2000.
[14] 谢金星,邢文训.现代优化计算方法[M].清华大学出版社,2001. |
