Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem

DOI10.1016/j.ejor.2009.05.041zbMath1175.90034OpenAlexW2082623421MaRDI QIDQ1039787

Zuo-Jun Max Shen, Lian Qi

Publication date: 23 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.041

zbMATH Keywords

aggregationerror bounds\(p\)-median

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Inventory, storage, reservoirs (90B05) Consumer behavior, demand theory (91B42)

Related Items

A quadtree-based allocation method for a class of large discrete Euclidean location problems ⋮ Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search ⋮ A mixed integer programming formulation and solution for traffic analysis zone delineation considering zone amount decision ⋮ An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On worst-case aggregation analysis for network location problems
• Aggregation error for location models: Survey and analysis
• Analysis of aggregation errors for the \(p\)-median problem
• On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
• Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem
• Probabilistic Analysis of Geometric Location Problems
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Probabilistic Analysis of the Planar k-Median Problem
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Aggregation Error Bounds for a Class of Location Models
• Nonlinear Programming
• Row-Column Aggregation for Rectilinear Distance p-Median Problems