References
- Aboolian, R., Berman, O., & Krass, D. (2007). Competitive facility location model with concave demand. European Journal of Operations Research, 181, 598–619.
- Alp, O., Drezner, Z., & Erkut, E. (2003). An efficient genetic algorithm for the p-median problem. Annals of Operations Research, 122, 21–42.
- Altınel, \.{I}. K., Aras, N., Güney, E., & Ersoy, C. (2008). Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks. Computer Networks, 52, 2419–2431.
- Beasley, J. E. (1990). OR-library - distributing test problems by electronic mail. Journal of the Operational Research Society, 41, 1069–1072.
- Berman, O., Drezner, Z., & Krass, D. (2010). Cooperative cover location problems: The planar case. IIE Transactions, 42, 232–246.
- Berman, O., Drezner, Z., Krass, D., & Wesolowsky, G. O. (2009). The variable radius covering problem. European Journal of Operational Research, 196, 516–525.
- Berman, O., Drezner, Z., & Wesolowsky, G. O. (2009). The maximal covering problem with some negative weights. Geographical Analysis, 41, 30–42.
- Berman, O., & Krass, D. (2002). The generalized maximal covering location problem. Computers and Operations Research, 29, 563–591.
- Berman, O., Krass, D., & Drezner, Z. (2003). The gradual covering decay location problem on a network. European Journal of Operational Research, 151, 474–480.
- Budge, S., Ingolfsson, A., & Zerom, D. (2010). Empirical analysis of ambulance travel times: the case of Calgary emergency medical services. Management Science, 56, 716–723.
- Church, R. L., & ReVelle, C. S. (1974). The maximal covering location problem. Papers of the Regional Science Association, 32, 101–118.
- Church, R. L., & Roberts, K. L. (1984). Generalized coverage models and public facility location. Papers of the Regional Science Association, 53, 117–135.
- Drezner, T. (2004). Location of casualty collection points. Environment and Planning C: Government and Policy, 22, 899–912.
- Drezner, T., & Drezner, Z. (2007). Equity models in planar location. Computational Management Science, 4, 1–16.
- Drezner, T.. & Drezner, Z. (2014). The maximin gradual cover location problem. OR Spectrum, 36, 903–921.
- Drezner, T., Drezner, Z., & Goldstein, Z. (2010). A stochastic gradual cover location problem. Naval Research Logistics, 57, 367–372.
- Drezner, Z., Wesolowsky, G. O., & Drezner, T. (2004). The gradual covering problem. Naval Research Logistics, 51, 841–855.
- Eiselt, H. A., & Marianov, V. (2009). Gradual location set covering with service quality. Socio-Economic Planning Sciences, 43, 121–130.
- Karabulut, E., Aras, N., & Altınel, \.{I}. K. (2017). Optimal sensor deployment to increase the security of the maximal breach path in border surveillance. European Journal of Operational Research, 259, 19–36.
- Karasakal, O., & Karasakal, E. (2004). A maximal covering location model in the presence of partial coverage. Computers and Operations Research, 31, 15–26.
- Klastorin, T. (1990). On a discrete nonlinear and nonseparable knapsack problem. Operations Research Letters, 9, 233–237.
- Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978). An analysis of approximations for maximizing submodular set functions I. Mathematical Programming, 14, 265–294.