Continuous space maximal coverage: insights, advances and challenges
From MaRDI portal
Publication:337677
DOI10.1016/j.cor.2014.04.010zbMath1348.90434OpenAlexW2413937858MaRDI QIDQ337677
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.04.010
Related Items (6)
A mean-shift algorithm for large-scale planar maximal covering location problems ⋮ Optimization models for cloud seeding network design and operations ⋮ Fairness in maximal covering location problems ⋮ Benders decomposition for very large scale partial set covering and maximal covering location problems ⋮ On the overlap area of a disk and a piecewise circular domain ⋮ OR models in urban service facility location: a critical review of applications and future developments
Cites Work
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights
- Stop location design in public transportation networks: covering and accessibility objectives
- Designing emergency response networks for hazardous materials transportation
- Aggregation effects in maximum covering models
- A new model for maximal coverage exploiting GIS capabilities
- The gradual covering decay location problem on a network.
- A computational approach for eliminating error in the solution of the location set covering problem
- Determining optimal police patrol areas with maximal covering and backup covering location models
- Covering continuous demand in the plane
- THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS
- Bicriterion Programs and Managerial Location Decisions: Application to the Banking Sector
- The generalized maximal covering location problem
This page was built for publication: Continuous space maximal coverage: insights, advances and challenges
