Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems

DOI10.1002/NAV.10079zbMATH Open1044.90044OpenAlexW2051305766MaRDI QIDQ4456087FDOQ4456087

Authors: Richard L. Francis, Timothy J. Lowe, Arie Tamir, M. Brenda Rayco 

Publication date: 15 March 2004

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.10079

Recommendations

• Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem
• On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
• Error-bound driven demand point aggregation for the rectilinear distance p-center model
• Row-Column Aggregation for Rectilinear Distance p-Median Problems
• Aggregation error for location models: Survey and analysis

zbMATH Keywords

location problems

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Efficient array partitioning

Cited In (7)

• Error-bound driven demand point aggregation for the rectilinear distance p-center model
• Comparative error bound theory for three location models: continuous demand versus discrete demand
• A quadtree-based allocation method for a class of large discrete Euclidean location problems
• Demand point aggregation method for covering problems with gradual coverage
• Aggregation error for location models: Survey and analysis
• Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem
• On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre

This page was built for publication: Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems

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