An extended continuous maximal covering location problem with facility placement
Explore this paper's citation graph
Summary
A formulation of the maximal covering problem when the facilities can be placed anywhere on the set R2 when the set of locations can be reduced to a finite set is discussed.
- Type
- article
- Published
- 1984-01-01
- Cited by
- 13
- References
- 3
- OpenAlex
- https://openalex.org/W1979540982
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:7621220
Keywords
Facility location problem, Set (abstract data type), Set cover problem, 1-center problem, Integer (computer science)
References
Cited by
- A mean-shift algorithm for large-scale planar maximal covering location problems
- Siting a facility in continuous space to maximize coverage of a region
- A computational approach for eliminating error in the solution of the location set covering problem
- A mixed integer formulation for maximal covering by inclined parallelograms
- Coverage optimization in continuous space facility siting
- Classical knapsack to geometric knapsack: A journey
- Public street lighting service standard assessment and achievement
- Enhancing equity in public transportation using geographic information systems and spatial optimization
- Optimal Taxi Placement Using a Maximal Covering Approach
- Fire stations siting with multiple objectives and geospatial big data
- Continuous Space Coverage
- Multiobjective Covering and Routing Problems
- Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey
Related papers
- Facility location: concepts, models, algorithms and case studies
- Facility Location and Covering Problems
- A 0-1 MODEL FOR FIRE AND EMERGENCY SERVICE FACILITY LOCATION SELECTION:A CASE STUDY IN NIGERIA
- The Power of Priority Algorithms for Facility Location and Set Cover
- The Location of Emergency Service Facilities
- On Covering Problems and the Central Facilities Location Problem
- Hybrid Covering Location Problem: Set Covering and Modular Maximal Covering Location Problem
- Using a facility location algorithm to solve large set covering problems
- Theoretical and Computational Links between the p‐Median, Location Set‐covering, and the Maximal Covering Location Problem
- Capacitated Covering Models