On the choice of aggregation points for continuous p-median problems: A case for the gravity centre

DOI10.1007/BF02579084MaRDI QIDQ1348705zbMATH OpenOpenAlexFDO

Authors Frank Plastria

Publication date 18 September 2002

Published in Top (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02579084

zbMATH Keywords

aggregationerror boundcontinuous location\(p\)-medianlocation-allocation

Mathematics Subject Classification ID

Continuous location (90B85)

Recommendations

• New error bounds in continuous minisum location for aggregation at the gravity centre
• Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem
• Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems
• Analysis of aggregation errors for the \(p\)-median problem
• Worst-case analysis of demand point aggregation for the Euclidean p-median problem

Cites work

• scientific article; zbMATH DE number 1253045 (Why is no real title available?)
• scientific article; zbMATH DE number 1091316 (Why is no real title available?)
• scientific article; zbMATH DE number 1775394 (Why is no real title available?)
• scientific article; zbMATH DE number 3027356 (Why is no real title available?)
• A projection method for \(l_ p\) norm location-allocation problems
• An optimal method for solving the (generalized) multi-Weber problem
• Analysis of aggregation errors for the \(p\)-median problem
• Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem
• Location and shape of a rectangular facility in \(\mathbb{R}^n\). Convexity properties
• Location-Allocation Problems
• New error bounds in continuous minisum location for aggregation at the gravity centre
• On the Complexity of Some Common Geometric Location Problems
• On worst-case aggregation analysis for network location problems
• Row-Column Aggregation for Rectilinear Distance p-Median Problems
• Sensitivity analysis of the optimal location of a facility
• The Weber problem with regional demand
• The demand partitioning method for reducing aggregation errors in \(p\)-median problems

Cited in

(13)

• Comparison of \(\alpha\)-Condorcet points with median and center locations
• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
• The \(p\)-median problem: a survey of metaheuristic approaches
• A framework for demand point and solution space aggregation analysis for location models
• A compelling argument for the gravity \(p\)-median model
• Aggregation error for location models: Survey and analysis
• New error bounds in continuous minisum location for aggregation at the gravity centre
• Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem
• Re-aggregation heuristic for large p-median problems
• An aggregation approach to solving the networkp-median problem with link demands
• Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems
• Demand point aggregation method for covering problems with gradual coverage
• Comparative error bound theory for three location models: continuous demand versus discrete demand

This page was built for publication: On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre

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