Demand point aggregation method for covering problems with gradual coverage

DOI10.1016/J.COR.2015.01.006MaRDI QIDQ337550zbMATH OpenOpenAlexFDO

Authors Hoon Jang, Taesik Lee

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

zbMATH Keywords

aggregationlocationcoveringdemandfacilitygradual

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• Demand point aggregation for planar covering location models
• Aggregation error for location models: Survey and analysis
• Aggregation effects in maximum covering models
• A framework for demand point and solution space aggregation analysis for location models
• The demand partitioning method for reducing aggregation errors in \(p\)-median problems

Cites work

• scientific article; zbMATH DE number 1803764 (Why is no real title available?)
• scientific article; zbMATH DE number 1253045 (Why is no real title available?)
• A \(p\)-center grid-positioning aggregation procedure
• A maximal covering location model in the presence of partial coverage
• A quadtree-based allocation method for a class of large discrete Euclidean location problems
• A stochastic gradual cover location problem
• Aggregation effects in maximum covering models
• Aggregation error for location models: Survey and analysis
• Aggregation without loss of optimality in competitive location models
• Ambulance location for maximum survival
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An aggregation heuristic for large scale p-median problem
• Analysis of aggregation errors for the \(p\)-median problem
• Covering models and optimization techniques for emergency response facility location and planning: a review
• Demand point aggregation for planar covering location models
• Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems
• Generalized coverage: new developments in covering location models
• Location analysis: a synthesis and survey
• NP-hardness of Euclidean sum-of-squares clustering
• New error bounds in continuous minisum location for aggregation at the gravity centre
• On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
• Row-Column Aggregation for Rectilinear Distance p-Median Problems
• The demand partitioning method for reducing aggregation errors in \(p\)-median problems

Cited in

(3)

• Demand point aggregation for planar covering location models
• Efficient presolving methods for solving maximal covering and partial set covering location problems
• Optimization for L₁-Norm Error Fitting via Data Aggregation

This page was built for publication: Demand point aggregation method for covering problems with gradual coverage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337550)