An extended continuous maximal covering location problem with facility placement
From MaRDI portal
We discuss a formulation of the maximal covering problem when the facilities can be placed anywhere on the set \(R^ 2\). A selection of such problems is given. In each case we shall see that the set of locations for facility placement can be reduced to a finite set. Lastly, one of the problems is then solved using an integer program formulation.
Recommendations
- scientific article; zbMATH DE number 1803755
- The generalized maximal covering location problem
- Location covering models. History, applications and advancements
- Continuous space maximal coverage: insights, advances and challenges
- Continuous maximal covering location problems with interconnected facilities
Cites work
Cited in
(11)- An extended continuous maximal covering location problem with facility placement
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- A mixed integer formulation for maximal covering by inclined parallelograms
- Continuous maximal covering location problems with interconnected facilities
- scientific article; zbMATH DE number 1803755 (Why is no real title available?)
- A mean-shift algorithm for large-scale planar maximal covering location problems
- The Maximal Covering Location Problem with Capacities on Total Workload
- Continuous space maximal coverage: insights, advances and challenges
- scientific article; zbMATH DE number 1253041 (Why is no real title available?)
- A practical heuristic for maximum coverage in large-scale continuous location problem
- Planar expropriation problem with non-rigid rectangular facilities
This page was built for publication: An extended continuous maximal covering location problem with facility placement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086128)