The (1|1)-Centroid Problem in the Plane with Distance Constraints
暂无分享,去创建一个
[1] Michiel H. M. Smid,et al. Discrete Voronoi games and ϵ-nets, in two and three dimensions , 2015, Comput. Geom..
[2] S. Hakimi. On locating new facilities in a competitive environment , 1983 .
[3] Nimrod Megiddo,et al. Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[4] Frank Plastria,et al. Static competitive facility location: An overview of optimisation approaches , 2001, Eur. J. Oper. Res..
[5] Gilbert Laporte,et al. Sequential location problems , 1997 .
[6] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[7] Yury Kochetov,et al. On the complexity of the (r|p)-centroid problem in the plane , 2014 .
[8] Angelika REISER. A Linear Selection Algorithm for Sets of Elements with Weights , 1978, Inf. Process. Lett..
[9] Gilbert Laporte,et al. Competitive Location Models: A Framework and Bibliography , 1993, Transp. Sci..
[10] R. Suárez-Vega,et al. The Leader–Follower Location Model , 2007 .
[11] Richard Cole,et al. Slowing down sorting networks to obtain faster sorting algorithms , 2015, JACM.
[12] Vladimir Marianov,et al. Competitive Location Models , 2019, Location Science.
[13] A. Dasci. Conditional Location Problems on Networks and in the Plane , 2011 .
[14] Z. Drezner. Competitive location strategies for two facilities , 1982 .
[15] Richard Cole,et al. Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[16] Zvi Drezner,et al. Competitive location in the plane , 1986, Ann. Oper. Res..
[17] D. T. Lee,et al. Geometric complexity of some location problems , 1986, Algorithmica.