The demand partitioning method for reducing aggregation errors in \(p\)-median problems
From MaRDI portal
Publication:1304504
DOI10.1016/S0305-0548(99)00020-9zbMath0940.90053OpenAlexW2025403493MaRDI QIDQ1304504
Paul H. Calamai, Robert L. Bowerman, G. Brent Hall
Publication date: 22 September 1999
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00020-9
Related Items
A framework for demand point and solution space aggregation analysis for location models, On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre, A quadtree-based allocation method for a class of large discrete Euclidean location problems, Demand point aggregation method for covering problems with gradual coverage, The \(p\)-median problem: a survey of metaheuristic approaches, Solving the \(p\)-median problem on regular and lattice networks, Comparative error bound theory for three location models: continuous demand versus discrete demand, An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems, Aggregation error for location models: Survey and analysis
