SEARCH

SEARCH BY CITATION

References

  • Akella, M. R., R. Batta, E. Delmelle, P. Rogerson, A. Blatt, and G. Wilson. (2005). “Base Station Location and Channel Allocation in a Cellular Network with Emergency Coverage Requirements.” European Journal of Operational Research 164, 301323.
  • Akella, M. R., E. Delmelle, R. Batta, P. Rogerson, and A. Blatt. (2010). “Adaptive Cell Tower Location Using Geostatistics.” Geographical Analysis 42, 227244.
  • Alexandris, G., and I. Giannikos. (2010). “A New Model for Maximal Coverage Exploiting GIS Capabilities.” European Journal of Operational Research 202, 328338.
  • Badri, M. A., A. K. Mortagy, and C. A. Alsayed. (1998). “A Multi-Objective Model for Locating Fire Stations.” European Journal of Operational Research 110, 243260.
  • Balas, E., and M. C. Carrera. (1996). “A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering.” Operations Research 44, 875890.
  • Batta, R., J. M. Dolan, and N. N. Krishnamurthy. (1989). “The Maximal Expected Covering Location Problem: Revisited.” Transportation Science 23, 277287.
  • Beasley, J. E. (1990a). “A Lagrangian Heuristic for Set-Covering Problems.” Naval Research Logistics 37, 151164.
  • Beasley, J. E. (1990b). “OR-Library: Distributing Test Problems by Electronic Mail.” Journal of the Operational Research Society 41, 10691072.
  • Beasley, J. E., and P. C. Chu. (1996). “A Genetic Algorithm for the Set Covering Problem.” European Journal of Operational Research 94, 392404.
  • Berman, O., and D. Krass. (2002). “The Generalized Maximal Covering Location Problem.” Computers and Operations Research 29, 563581.
  • Berman, O., Z. Drezner, D. Krass, and G. O. Wesolowsky. (2009). “The Variable Radius Covering Problem.” European Journal of Operational Research 196, 516525.
  • Berman, O., Z. Drezner, and D. Krass. (2010). “Generalized Coverage: New Developments in Covering Location Models.” Computers and Operations Research 37, 16751687.
  • Caprara, A., M. Fischetti, and P. Toth. (1999). “A Heuristic Method for the Set Covering Problem.” Operations Research 47, 730743.
  • Chevalier, P., I. Thomas, D. Geraets, E. Goetghebeur, O. Janssens, D. Peeters, and F. Plastria. (2012). “Locating Fire Stations: An Integrated Approach for Belgium.” Socio-Economic Planning Sciences 46, 173182.
  • Church, R. L. (2002). “Geographical Information Systems and Location Science.” Computers and Operations Research 29, 541562.
  • Church, R. L., and A. T. Murray. (2009). Business Site Selection, Location Analysis, and GIS. New York: Wiley.
  • Church, R. L., and C. ReVelle. (1974). “The Maximal Covering Location Problem.” Papers in Regional Science 32, 101118.
  • Cromley, R. G., J. Lin, and D. A. Merwin. (2012). “Evaluating Representation and Scale Error in the Maximal Covering Location Problem Using GIS and Intelligent Areal Interpolation.” International Journal of Geographical Information Science 26, 495517.
  • Current, J., and M. O'Kelly. (1992). “Locating Emergency Warning Sirens.” Decision Sciences 23, 221234.
  • Current, J., and J. Storbeck. (1988). “Capacitated Covering Models.” Environment and Planning B: Planning and Design 15, 153164.
  • Daskin, M. S. (1983). “A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution.” Transportation Science 17, 4870.
  • Daskin, M. S., and E. H. Stern. (1981). “A Hierarchical Objective Set Covering Model for Emergency Medical Service Vehicle Deployment.” Transportation Science 15, 137152.
  • De Berg, M., O. Cheong, M. Van Kreveld, and M. Overmars. (2008). Computational Geometry: Algorithms and Applications. Berlin: Springer.
  • Downs, B. T., and J. D. Camm. (1996). “An Exact Algorithm for the Maximal Covering Problem.” Naval Research Logistics 43, 435461.
  • Drezner, Z., G. O. Wesolowsky, and T. Drezner. (2004). “The Gradual Covering Problem.” Naval Research Logistic 51, 841855.
  • Galvao, R. D., and C. ReVelle. (1996). “A Lagrangean Heuristic for the Maximal Covering Location Problem.” European Journal of Operational Research 88, 114123.
  • Garey, M. R., and D. S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman.
  • Grubesic, T. H., and A. T. Murray. (2002). “Constructing the Divide: Spatial Disparities in Broadband Access.” Papers in Regional Science 81, 197221.
  • Gutiérrez, J., and J. C. García-Palomares. (2011). “Distance-Measure Impacts on the Calculation of Transport Service Areas Using GIS.” Environment and Planning B: Planning and Design 35, 480503.
  • Hogan, K., and C. ReVelle. (1986). “Concepts and Applications of Backup Coverage.” Management Science 32, 14341444.
  • Jacobs, L. W., and M. J. Brusco. (1995). “A Local Search Heuristic for Large Set-Covering Problems.” Naval Research Logistics 42, 11291140.
  • Lan, G., G. W. Depuy, and G. E. Whitehouse. (2007). “An Effective and Simple Heuristic for the Set Covering Problem.” European Journal of Operational Research 176, 13871403.
  • Miliotis, P., M. Dimopoulou, and I. Giannikos. (2002). “A Hierarchical Location Model for Locating Bank Branches in A Competitive Environment.” International Transactions in Operational Research 9, 549565.
  • Miller, H. J. (1996). “GIS and Geometric Representation in Facility Location Problems.” International Journal of Geographical Information Systems 10, 791816.
  • Murray, A. T. (2005). “Geography in Coverage Modeling: Exploiting Spatial Structure to Address Complementary Partial Service of Areas.” Annals of the Association of American Geographers 95, 761772.
  • Murray, A. T. (2010). “Advances in Location Modeling: GIS Linkages and Contributions.” Journal of Geographical Systems 12, 335354.
  • Murray, A. T., and M. E. O'Kelly. (2002). “Assessing Representation Error in Point-Based Coverage Modeling.” Journal of Geographical Systems 4, 171191.
  • Murray, A. T., and D. Tong. (2007). “Coverage Optimization in Continuous Space Facility Siting.” International Journal of Geographical Information Science 21, 757776.
  • Murray, A. T., and R. Wei. (2013). “A Computational Approach for Eliminating Error in the Solution of the Location Set Covering Problem.” European Journal of Operational Research 224, 5264.
  • Murray, A. T., M. E. O'Kelly, and R. L. Church. (2008). “Regional Service Coverage Modeling.” Computers and Operations Research 35, 339355.
  • Murray, A. T., D. Tong, and K. Kim. (2010). “Enhancing Classic Coverage Location Models.” International Regional Science Review 33, 115133.
  • Murray, A. T., D. Tong, and T. H. Grubesic. (2012). “Spatial Optimisation: Expanding Emergency Services to Address Regional Growth and Development.” In Studies In Applied Geography and Spatial Analysis: Addressing Real World Issues, 109122, edited by R. Stimson and K. Haynes. New York: Edward Elgar.
  • NCGIA. (1997). “The Polygon Overlay Operation.” Available at http://www.ncgia.ucsb.edu/giscc/units/u186/u186.html (accessed on 22 April 2013).
  • Nobili, P., and A. Sassano. (1992). “A Separation Routine for the Set Covering Polytope.” In Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 201219, edited by E. C. E. Balas, G. Cornuéjols and R. Kannan. Pittsburgh: Carnegie Mellon University Press.
  • Openshaw, S., and P. Taylor. (1981). “The Modifiable Areal Unit Problem.” In Quantitative Geography: A British View, 6070, edited by N. Wrigley and R. J. Bennett. London: Routledge and Kegan Paul.
  • Park, S. C., and H. Shin. (2002). “Polygonal Chain Iintersection.” Computers and Graphics 26, 341350.
  • Plastria, F., and E. Carrizosa. (1999). “Undesirable Facility Location with Minimal Covering Objectives.” European Journal of Operational Research 119, 158180.
  • Ren, Z. G., Z. R. Feng, L. J. Ke, and Z. J. Zhang. (2010). “New Ideas for Applying Ant Colony Optimization to the Set Covering Problem.” Computers and Industrial Engineering 58, 774784.
  • ReVelle, C. (1991). “Siting Ambulances and Fire Companies: New Tools for Planners.” Journal of the American Planning Association 57, 471484.
  • Saalfeld, A. (1989). “ “The Combinatorial Complexity of Polygon Overlay.” In Ninth International Symposium on Computer-Assisted Cartography, 278288, edited by ASPRS. Baltimore: The Society.
  • Shillington, L., and D. Tong. (2011). “Maximizing Wireless Mesh Network Coverage.” International Regional Science Review 34, 419437.
  • Tavakoli, A., and C. Lightner. (2004). “Implementing A Mathematical Model for Locating EMS Vehicles in Fayetteville, NC.” Computers and Operations Research 31, 15491563.
  • Tong, D. (2012). “Regional Coverage Maximization: A New Model to Account Implicitly for Complementary Coverage.” Geographical Analysis 44, 114.
  • Tong, D., and R. L. Church. (2012). “Aggregation in Continuous Space Coverage Modeling.” International Journal of Geographical Information Science 26, 795816.
  • Tong, D., and A. T. Murray. (2009). “Maximising Coverage of Spatial Demand for Service.” Papers in Regional Science 88, 8597.
  • Toregas, C., and C. ReVelle. (1973). “Binary Logic Solutions to A Class of Location Problem.” Geographical Analysis 5, 145155.
  • Toregas, C., R. Swain, C. ReVelle, and L. Bergman. (1971). “The Location of Emergency Service Facilities.” Operations Research 19, 13631373.
  • Wang, F. (1993). “A Parallel Intersection Algorithm for Vector Polygon Overlay.” Computer Graphics and Applications, IEEE 13, 7481.
  • Waugh, T. C., and S. Hopkins. (1992). “An Algorithm for Polygon Overlay Using Cooperative Parallel Processing.” International Journal of Geographical Information Science 6, 457467.
  • Yaglom, A. M., and I. M. Yaglom. (1987). Challenging Mathematical Problems with Elementary Solutions. Mineola, NY: Dover Publications.
  • Yelbay, B., S. I. Birbil, and K. Bülbül. (2012). “The Set Covering Problem Revisited: An Empirical Study of the Value of Dual Information.” Available at http://www.optimization-online.org/DB_FILE/2010/11/2814.pdf (accessed on 22 April 2013).
  • Yin, P., and L. Mu. (2012). “Modular Capacitated Maximal Covering Location Problem for the Optimal Siting of Emergency Vehicles.” Applied Geography 34, 247254.