A framework for demand point and solution space aggregation analysis for location models

DOI10.1016/S0377-2217(03)00433-8zbMath1065.90053OpenAlexW2034576756MaRDI QIDQ1887955

H. Emir-Farinas, Timothy J. Lowe, Arie Tamir, Richard L. Francis

Publication date: 22 November 2004

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00433-8

zbMATH Keywords

LocationCovering\(K\)-centersAggregation errorDemand points

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

A framework for demand point and solution space aggregation analysis for location models, Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region, A bi-objective modeling approach applied to an urban semi-desirable facility location problem, Comparative error bound theory for three location models: continuous demand versus discrete demand, A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints, Public facility location using dispersion, population, and equity criteria, Aggregation error for location models: Survey and analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On worst-case aggregation analysis for network location problems
• A simple heuristic for the p-centre problem
• Demand point aggregation for planar covering location models
• Aggregation effects in maximum covering models
• Analysis of aggregation errors for the \(p\)-median problem
• The demand partitioning method for reducing aggregation errors in \(p\)-median problems
• A \(p\)-center grid-positioning aggregation procedure
• 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
• A framework for demand point and solution space aggregation analysis for location models
• Probabilistic Analysis of Geometric Location Problems
• Finite Dominating Sets for Network Location Problems
• Error-bound driven demand point aggregation for the rectilinear distance p-center model
• Aggregation Error Bounds for a Class of Location Models
• An aggregation approach to solving the networkp-median problem with link demands
• The Set-Partitioning Problem: Set Covering with Equality Constraints