Probabilistic, Maximal Covering Location—Allocation Models forCongested Systems
暂无分享,去创建一个
[1] Richard L. Church,et al. The maximal covering location problem , 1974 .
[2] Amedeo R. Odoni,et al. A single-server priority queueing-location model , 1988, Networks.
[3] Oded Berman,et al. Optimal Server Location on a Network Operating as an M/G/1 Queue , 1985, Oper. Res..
[4] Rajan Batta,et al. A queueing-location model with expected service time dependent queueing disciplines , 1989 .
[5] Said Salhi,et al. Facility Location: A Survey of Applications and Methods , 1996 .
[6] Oded Berman,et al. Location-allocation on congested networks , 1986 .
[7] C. Revelle,et al. The queuing probabilistic location set covering problem and some extensions , 1994 .
[8] Oded Berman,et al. Optimal 2-Facility Network Districting in the Presence of Queuing , 1985, Transp. Sci..
[9] Richard C. Larson,et al. Urban Operations Research , 1981 .
[10] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .
[11] Ronald W. Wolff,et al. Stochastic Modeling and the Theory of Queues , 1989 .
[12] Rajan Batta,et al. Single Server Queueing-Location Models with Rejection , 1988, Transp. Sci..