Demand point aggregation method for covering problems with gradual coverage
From MaRDI portal
Publication:337550
DOI10.1016/j.cor.2015.01.006zbMath1348.90399OpenAlexW2004462327MaRDI QIDQ337550
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.2015.01.006
Related Items (2)
Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ Optimization for L1-Norm Error Fitting via Data Aggregation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A quadtree-based allocation method for a class of large discrete Euclidean location problems
- Demand point aggregation for planar covering location models
- Aggregation without loss of optimality in competitive location models
- Aggregation effects in maximum covering models
- Generalized coverage: new developments in covering location models
- NP-hardness of Euclidean sum-of-squares clustering
- Aggregation error for location models: Survey and analysis
- Analysis of aggregation errors for the \(p\)-median problem
- The demand partitioning method for reducing aggregation errors in \(p\)-median problems
- A \(p\)-center grid-positioning aggregation procedure
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
- An aggregation heuristic for large scale p-median problem
- Location analysis: a synthesis and survey
- A maximal covering location model in the presence of partial coverage
- Covering models and optimization techniques for emergency response facility location and planning: a review
- Ambulance location for maximum survival
- A stochastic gradual cover location problem
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems
- Row-Column Aggregation for Rectilinear Distance p-Median Problems
This page was built for publication: Demand point aggregation method for covering problems with gradual coverage
